Base | Representation |
---|---|
bin | 11011010010100001011100… |
… | …101111111110100010010010 |
3 | 120201221210220200020201100220 |
4 | 123102201130233332202102 |
5 | 111212402202240401320 |
6 | 1103132252153253510 |
7 | 34165111341104661 |
oct | 3322413457764222 |
9 | 521853820221326 |
10 | 120020122200210 |
11 | 35273280078041 |
12 | 11564854104296 |
13 | 51c7b0621bb0b |
14 | 218d00d684dd8 |
15 | dd1eeaeade40 |
hex | 6d285cbfe892 |
120020122200210 has 32 divisors (see below), whose sum is σ = 289243514431872. Its totient is φ = 31872563569920.
The previous prime is 120020122200109. The next prime is 120020122200227. The reversal of 120020122200210 is 12002221020021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 120020122200210.
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, 8300139534 + ... + 8300153993.
It is an arithmetic number, because the mean of its divisors is an integer number (9038859825996).
Almost surely, 2120020122200210 is an apocalyptic number.
120020122200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120020122200210 is an abundant number, since it is smaller than the sum of its proper divisors (169223392231662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120020122200210 is a wasteful number, since it uses less digits than its factorization.
120020122200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16600293778.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 120020122200210 its reverse (12002221020021), we get a palindrome (132022343220231).
The spelling of 120020122200210 in words is "one hundred twenty trillion, twenty billion, one hundred twenty-two million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •