Base | Representation |
---|---|
bin | 10111001110000011101100… |
… | …000000100110101010001100 |
3 | 111101120200102011221221200012 |
4 | 113032003230000212222030 |
5 | 101341123004103323040 |
6 | 1001105441524052352 |
7 | 30340002051562661 |
oct | 2716035400465214 |
9 | 441520364857605 |
10 | 102121102011020 |
11 | 2a5a2352880294 |
12 | b5539065340b8 |
13 | 44c9c94c9a7b1 |
14 | 1b3098b10ba68 |
15 | bc160e384865 |
hex | 5ce0ec026a8c |
102121102011020 has 48 divisors (see below), whose sum is σ = 218918370021120. Its totient is φ = 40003409459136.
The previous prime is 102121102011013. The next prime is 102121102011101. The reversal of 102121102011020 is 20110201121201.
It is a junction number, because it is equal to n+sod(n) for n = 102121102010986 and 102121102011004.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164220662 + ... + 164841341.
It is an arithmetic number, because the mean of its divisors is an integer number (4560799375440).
Almost surely, 2102121102011020 is an apocalyptic number.
102121102011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102121102011020 is an abundant number, since it is smaller than the sum of its proper divisors (116797268010100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121102011020 is a wasteful number, since it uses less digits than its factorization.
102121102011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329062334 (or 329062332 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102121102011020 its reverse (20110201121201), we get a palindrome (122231303132221).
The spelling of 102121102011020 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred two million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •