101,146
101,146 is a composite number, even.
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 13
- Digit product
- 0
- Digital root
- 4
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 641,101
- Recamán's sequence
- a(98,507) = 101,146
- Square (n²)
- 10,230,513,316
- Cube (n³)
- 1,034,775,499,860,136
- Divisor count
- 8
- σ(n) — sum of divisors
- 153,504
- φ(n) — Euler's totient
- 49,980
- Sum of prime factors
- 596
Primality
Prime factorization: 2 × 103 × 491
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√101,146 = [318; (28, 1, 10, 5, 6, 25, 3, 1, 1, 4, 7, 10, 1, 4, 1, 4, 1, 1, 3, 1, 2, 3, 1, 3, …)]
Representations
- In words
- one hundred one thousand one hundred forty-six
- Ordinal
- 101146th
- Binary
- 11000101100011010
- Octal
- 305432
- Hexadecimal
- 0x18B1A
- Base64
- AYsa
- One's complement
- 4,294,866,149 (32-bit)
- Scientific notation
- 1.01146 × 10⁵
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓆼𓍢𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ραρμϛʹ
- Mayan (base 20)
- 𝋬·𝋬·𝋱·𝋦
- Chinese
- 一十萬一千一百四十六
- Chinese (financial)
- 壹拾萬壹仟壹佰肆拾陸
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 101146, here are decompositions:
- 5 + 101141 = 101146
- 29 + 101117 = 101146
- 83 + 101063 = 101146
- 137 + 101009 = 101146
- 233 + 100913 = 101146
- 239 + 100907 = 101146
- 293 + 100853 = 101146
- 317 + 100829 = 101146
Showing the first eight; more decompositions exist.
UTF-8 encoding: F0 98 AC 9A (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.1.139.26.
- Address
- 0.1.139.26
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.139.26
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 101,146 and was likely granted around 1870.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.