Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000101101001110010 |
3 | 101111221002121011021221 |
4 | 1212130201011221302 |
5 | 3300240011231002 |
6 | 122311111535254 |
7 | 10642622303560 |
oct | 1463441055162 |
9 | 344832534257 |
10 | 110000102002 |
11 | 4271820a80a |
12 | 1939a98a52a |
13 | a4b053446b |
14 | 547720ca30 |
15 | 2cdc117c37 |
hex | 199c845a72 |
110000102002 has 32 divisors (see below), whose sum is σ = 189090570240. Its totient is φ = 47013330960.
The previous prime is 110000101993. The next prime is 110000102011. The reversal of 110000102002 is 200201000011.
It is an interprime number because it is at equal distance from previous prime (110000101993) and next prime (110000102011).
It is a Harshad number since it is a multiple of its sum of digits (7).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8683149 + ... + 8695807.
It is an arithmetic number, because the mean of its divisors is an integer number (5909080320).
Almost surely, 2110000102002 is an apocalyptic number.
110000102002 is a deficient number, since it is larger than the sum of its proper divisors (79090468238).
110000102002 is a wasteful number, since it uses less digits than its factorization.
110000102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14326.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 110000102002 its reverse (200201000011), we get a palindrome (310201102013).
The spelling of 110000102002 in words is "one hundred ten billion, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •