Base | Representation |
---|---|
bin | 110111111000010110… |
… | …0000110100101001000 |
3 | 102110202011022220012202 |
4 | 1233300230012211020 |
5 | 3431231031210440 |
6 | 131043411455332 |
7 | 11445523645622 |
oct | 1576054064510 |
9 | 373664286182 |
10 | 120002210120 |
11 | 46990134671 |
12 | 1b3105b7548 |
13 | b4157ac330 |
14 | 5b4575dc12 |
15 | 31c5290615 |
hex | 1bf0b06948 |
120002210120 has 32 divisors (see below), whose sum is σ = 290774587320. Its totient is φ = 44308508160.
The previous prime is 120002210021. The next prime is 120002210123. The reversal of 120002210120 is 21012200021.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 101951212804 + 18050997316 = 319298^2 + 134354^2 .
It is not an unprimeable number, because it can be changed into a prime (120002210123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115386221 + ... + 115387260.
Almost surely, 2120002210120 is an apocalyptic number.
120002210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120002210120 is an abundant number, since it is smaller than the sum of its proper divisors (170772377200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002210120 is a wasteful number, since it uses less digits than its factorization.
120002210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230773505 (or 230773501 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 120002210120 its reverse (21012200021), we get a palindrome (141014410141).
The spelling of 120002210120 in words is "one hundred twenty billion, two million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •