Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …110101100111110101100100 |
3 | 111021000000122011011201002002 |
4 | 112333112002311213311210 |
5 | 101223041310133210040 |
6 | 555013145124104432 |
7 | 30203646362224133 |
oct | 2677260265476544 |
9 | 437000564151062 |
10 | 101110020210020 |
11 | 2a242578526278 |
12 | b40b971235118 |
13 | 4455831b66573 |
14 | 1ad7a72dbd91a |
15 | ba5184cc1a15 |
hex | 5bf582d67d64 |
101110020210020 has 24 divisors (see below), whose sum is σ = 212641922473344. Its totient is φ = 40384792839776.
The previous prime is 101110020210013. The next prime is 101110020210113. The reversal of 101110020210020 is 20012020011101.
It is a junction number, because it is equal to n+sod(n) for n = 101110020209983 and 101110020210010.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3700938764 + ... + 3700966083.
It is an arithmetic number, because the mean of its divisors is an integer number (8860080103056).
Almost surely, 2101110020210020 is an apocalyptic number.
101110020210020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101110020210020 is an abundant number, since it is smaller than the sum of its proper divisors (111531902263324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110020210020 is a wasteful number, since it uses less digits than its factorization.
101110020210020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7401905539 (or 7401905537 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101110020210020 its reverse (20012020011101), we get a palindrome (121122040221121).
The spelling of 101110020210020 in words is "one hundred one trillion, one hundred ten billion, twenty million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •