Base | Representation |
---|---|
bin | 11011010011111110101010… |
… | …011101011100010010101010 |
3 | 120202022101020222111112002220 |
4 | 123103332222131130102222 |
5 | 111221022142303241020 |
6 | 1103250243542534510 |
7 | 34205253534135441 |
oct | 3323765235342252 |
9 | 522271228445086 |
10 | 120120210212010 |
11 | 35301771156768 |
12 | 11580127437436 |
13 | 5204397035538 |
14 | 2193bc6295d58 |
15 | dd4907cd1240 |
hex | 6d3faa75c4aa |
120120210212010 has 32 divisors (see below), whose sum is σ = 297588133688832. Its totient is φ = 30998763925440.
The previous prime is 120120210211999. The next prime is 120120210212011. The reversal of 120120210212010 is 10212012021021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (120120210212011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64580757249 + ... + 64580759108.
It is an arithmetic number, because the mean of its divisors is an integer number (9299629177776).
Almost surely, 2120120210212010 is an apocalyptic number.
120120210212010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120120210212010 is an abundant number, since it is smaller than the sum of its proper divisors (177467923476822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120120210212010 is a wasteful number, since it uses less digits than its factorization.
120120210212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129161516398.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120120210212010 its reverse (10212012021021), we get a palindrome (130332222233031).
The spelling of 120120210212010 in words is "one hundred twenty trillion, one hundred twenty billion, two hundred ten million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •