Base | Representation |
---|---|
bin | 110111111011110110… |
… | …1100001000011010000 |
3 | 102111001101000022122002 |
4 | 1233313231201003100 |
5 | 3432001211134300 |
6 | 131103220533132 |
7 | 11451454222304 |
oct | 1576755410320 |
9 | 374041008562 |
10 | 120120021200 |
11 | 46a406908a3 |
12 | 1b343b511a8 |
13 | b43401ab2a |
14 | 5b57269d04 |
15 | 31d07b25d5 |
hex | 1bf7b610d0 |
120120021200 has 120 divisors (see below), whose sum is σ = 307015974720. Its totient is φ = 45006796800.
The previous prime is 120120021143. The next prime is 120120021233. The reversal of 120120021200 is 2120021021.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1392941 + ... + 1476659.
It is an arithmetic number, because the mean of its divisors is an integer number (2558466456).
Almost surely, 2120120021200 is an apocalyptic number.
120120021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120120021200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153507987360).
120120021200 is an abundant number, since it is smaller than the sum of its proper divisors (186895953520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120120021200 is a wasteful number, since it uses less digits than its factorization.
120120021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83965 (or 83954 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 120120021200 its reverse (2120021021), we get a palindrome (122240042221).
The spelling of 120120021200 in words is "one hundred twenty billion, one hundred twenty million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •