Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …101011010000100000111000 |
3 | 111101012011021110022022202212 |
4 | 113030131022223100200320 |
5 | 101332322032400213422 |
6 | 1000543114404114252 |
7 | 30326024125356404 |
oct | 2714351253204070 |
9 | 441164243268685 |
10 | 102011021101112 |
11 | 2a55a6a3a98392 |
12 | b536504695988 |
13 | 44bc7a0ab2306 |
14 | 1b295072a6104 |
15 | bbd81a1089e2 |
hex | 5cc74aad0838 |
102011021101112 has 64 divisors (see below), whose sum is σ = 194429010744000. Its totient is φ = 50170665600000.
The previous prime is 102011021101111. The next prime is 102011021101127. The reversal of 102011021101112 is 211101120110201.
It is a super-3 number, since 3×1020110211011123 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011021101111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105803612 + ... + 106763412.
It is an arithmetic number, because the mean of its divisors is an integer number (3037953292875).
Almost surely, 2102011021101112 is an apocalyptic number.
It is an amenable number.
102011021101112 is a deficient number, since it is larger than the sum of its proper divisors (92417989642888).
102011021101112 is a wasteful number, since it uses less digits than its factorization.
102011021101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960768 (or 960764 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102011021101112 its reverse (211101120110201), we get a palindrome (313112141211313).
The spelling of 102011021101112 in words is "one hundred two trillion, eleven billion, twenty-one million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •