Base | Representation |
---|---|
bin | 10111001100010011111100… |
… | …000011011011000011110110 |
3 | 111101011012200212202222011210 |
4 | 113030103330003123003312 |
5 | 101332141234144213420 |
6 | 1000534355231542250 |
7 | 30325223434303515 |
oct | 2714237403330366 |
9 | 441135625688153 |
10 | 102001112101110 |
11 | 2a556479687a92 |
12 | b5345ba08a986 |
13 | 44bb881c06cc1 |
14 | 1b28c4727067c |
15 | bbd43a2239e0 |
hex | 5cc4fc0db0f6 |
102001112101110 has 128 divisors (see below), whose sum is σ = 246537150612480. Its totient is φ = 27008060276736.
The previous prime is 102001112101103. The next prime is 102001112101129. The reversal of 102001112101110 is 11101211100201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13796981574 + ... + 13796988966.
It is an arithmetic number, because the mean of its divisors is an integer number (1926071489160).
Almost surely, 2102001112101110 is an apocalyptic number.
102001112101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102001112101110 is an abundant number, since it is smaller than the sum of its proper divisors (144536038511370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001112101110 is a wasteful number, since it uses less digits than its factorization.
102001112101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11062.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 102001112101110 its reverse (11101211100201), we get a palindrome (113102323201311).
The spelling of 102001112101110 in words is "one hundred two trillion, one billion, one hundred twelve million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •