Base | Representation |
---|---|
bin | 11011010101001010110110… |
… | …101101000011110011000000 |
3 | 120202121012102110001220212111 |
4 | 123111022312231003303000 |
5 | 111223342214110324300 |
6 | 1103352013510505104 |
7 | 34214211053016511 |
oct | 3325126655036300 |
9 | 522535373056774 |
10 | 120202020011200 |
11 | 353334326aa756 |
12 | 11593b59365194 |
13 | 520c0040ab73a |
14 | 2197b47538a08 |
15 | dd6ae50e19ba |
hex | 6d52b6b43cc0 |
120202020011200 has 42 divisors (see below), whose sum is σ = 295772095493996. Its totient is φ = 48080808003840.
The previous prime is 120202020011191. The next prime is 120202020011257. The reversal of 120202020011200 is 2110020202021.
It is a happy number.
It is a super-2 number, since 2×1202020200112002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 37563129654 + ... + 37563132853.
Almost surely, 2120202020011200 is an apocalyptic number.
120202020011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120202020011200 is an abundant number, since it is smaller than the sum of its proper divisors (175570075482796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120202020011200 is an equidigital number, since it uses as much as digits as its factorization.
120202020011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75126262529 (or 75126262514 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 120202020011200 its reverse (2110020202021), we get a palindrome (122312040213221).
The spelling of 120202020011200 in words is "one hundred twenty trillion, two hundred two billion, twenty million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •