Base | Representation |
---|---|
bin | 11011010010010000101011… |
… | …010000100110001000010100 |
3 | 120201220002102111220211002220 |
4 | 123102100223100212020110 |
5 | 111212103311134133022 |
6 | 1103120113104502340 |
7 | 34163603130105624 |
oct | 3322205320461024 |
9 | 521802374824086 |
10 | 120002112021012 |
11 | 35266678872921 |
12 | 1156126861a9b0 |
13 | 51c61c5b66250 |
14 | 218c1c1768884 |
15 | dd17e4c9485c |
hex | 6d242b426214 |
120002112021012 has 96 divisors (see below), whose sum is σ = 302090112213120. Its totient is φ = 36856843223040.
The previous prime is 120002112020983. The next prime is 120002112021023. The reversal of 120002112021012 is 210120211200021.
It is a junction number, because it is equal to n+sod(n) for n = 120002112020982 and 120002112021000.
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, 778747812 + ... + 778901892.
It is an arithmetic number, because the mean of its divisors is an integer number (3146772002220).
Almost surely, 2120002112021012 is an apocalyptic number.
120002112021012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120002112021012 is an abundant number, since it is smaller than the sum of its proper divisors (182088000192108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002112021012 is a wasteful number, since it uses less digits than its factorization.
120002112021012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163113 (or 163111 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120002112021012 its reverse (210120211200021), we get a palindrome (330122323221033).
The spelling of 120002112021012 in words is "one hundred twenty trillion, two billion, one hundred twelve million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •