Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …010011000100000000101110 |
3 | 111101111122221121220020000202 |
4 | 113031300002103010000232 |
5 | 101340301300241041420 |
6 | 1001052032030353502 |
7 | 30335324131110161 |
oct | 2715600223040056 |
9 | 441448847806022 |
10 | 102100001112110 |
11 | 2a594404982661 |
12 | b54b7b795b892 |
13 | 44c7cb14b8cb1 |
14 | 1b2d948931ad8 |
15 | bc0cc6b56575 |
hex | 5cdc024c402e |
102100001112110 has 8 divisors (see below), whose sum is σ = 183780002001816. Its totient is φ = 40840000444840.
The previous prime is 102100001112089. The next prime is 102100001112113. The reversal of 102100001112110 is 11211100001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102100001112091 and 102100001112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100001112113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5105000055596 + ... + 5105000055615.
It is an arithmetic number, because the mean of its divisors is an integer number (22972500250227).
Almost surely, 2102100001112110 is an apocalyptic number.
102100001112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100001112110 is a deficient number, since it is larger than the sum of its proper divisors (81680000889706).
102100001112110 is a wasteful number, since it uses less digits than its factorization.
102100001112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10210000111218.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102100001112110 its reverse (11211100001201), we get a palindrome (113311101113311).
The spelling of 102100001112110 in words is "one hundred two trillion, one hundred billion, one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •