Base | Representation |
---|---|
bin | 11011010010011001001001… |
… | …000100100101000100011010 |
3 | 120201220221220000112210110020 |
4 | 123102121021010211010122 |
5 | 111212230420220401020 |
6 | 1103124215105131310 |
7 | 34164344315513043 |
oct | 3322311104450432 |
9 | 521827800483406 |
10 | 120011202122010 |
11 | 3526a512a04291 |
12 | 11562b84929b36 |
13 | 51c70141a2434 |
14 | 218c804b158ca |
15 | dd1b77d1cc40 |
hex | 6d264912511a |
120011202122010 has 64 divisors (see below), whose sum is σ = 297322215874560. Its totient is φ = 30970201458240.
The previous prime is 120011202121999. The next prime is 120011202122051. The reversal of 120011202122010 is 10221202110021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68817211 + ... + 70539569.
It is an arithmetic number, because the mean of its divisors is an integer number (4645659623040).
Almost surely, 2120011202122010 is an apocalyptic number.
120011202122010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120011202122010 is an abundant number, since it is smaller than the sum of its proper divisors (177311013752550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120011202122010 is a wasteful number, since it uses less digits than its factorization.
120011202122010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1797323.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120011202122010 its reverse (10221202110021), we get a palindrome (130232404232031).
The spelling of 120011202122010 in words is "one hundred twenty trillion, eleven billion, two hundred two million, one hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •