Base | Representation |
---|---|
bin | 11011010010100010010111… |
… | …101000001101100001110100 |
3 | 120201221220110112000011122220 |
4 | 123102202113220031201310 |
5 | 111212411213131121322 |
6 | 1103132534201522340 |
7 | 34165144664326452 |
oct | 3322422750154164 |
9 | 521856415004586 |
10 | 120021110020212 |
11 | 35273737731905 |
12 | 11564a8aaa33b0 |
13 | 51c7c32a830ab |
14 | 218d0a49419d2 |
15 | dd2057a8655c |
hex | 6d2897a0d874 |
120021110020212 has 48 divisors (see below), whose sum is σ = 280445523644160. Its totient is φ = 39950429803648.
The previous prime is 120021110020193. The next prime is 120021110020223. The reversal of 120021110020212 is 212020011120021.
It is a junction number, because it is equal to n+sod(n) for n = 120021110020191 and 120021110020200.
It is a congruent number.
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, 417563698 + ... + 417851030.
It is an arithmetic number, because the mean of its divisors is an integer number (5842615075920).
Almost surely, 2120021110020212 is an apocalyptic number.
120021110020212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120021110020212 is an abundant number, since it is smaller than the sum of its proper divisors (160424413623948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120021110020212 is a wasteful number, since it uses less digits than its factorization.
120021110020212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336472 (or 336470 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120021110020212 its reverse (212020011120021), we get a palindrome (332041121140233).
The spelling of 120021110020212 in words is "one hundred twenty trillion, twenty-one billion, one hundred ten million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •