Base | Representation |
---|---|
bin | 10111001110000011101100… |
… | …000000100100001111010110 |
3 | 111101120200102011221110002011 |
4 | 113032003230000210033112 |
5 | 101341123004103013420 |
6 | 1001105441523534434 |
7 | 30340002051522043 |
oct | 2716035400441726 |
9 | 441520364843064 |
10 | 102121102001110 |
11 | 2a5a23528738a5 |
12 | b55390652a41a |
13 | 44c9c94c9612a |
14 | 1b3098b1081ca |
15 | bc160e38195a |
hex | 5ce0ec0243d6 |
102121102001110 has 64 divisors (see below), whose sum is σ = 189948144697344. Its totient is φ = 39488976950400.
The previous prime is 102121102001071. The next prime is 102121102001131. The reversal of 102121102001110 is 11100201121201.
It is a happy number.
It is a super-2 number, since 2×1021211020011102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5146444849 + ... + 5146464691.
It is an arithmetic number, because the mean of its divisors is an integer number (2967939760896).
Almost surely, 2102121102001110 is an apocalyptic number.
102121102001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102121102001110 is a deficient number, since it is larger than the sum of its proper divisors (87827042696234).
102121102001110 is a wasteful number, since it uses less digits than its factorization.
102121102001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36589.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102121102001110 its reverse (11100201121201), we get a palindrome (113221303122311).
The spelling of 102121102001110 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred two million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •