Base | Representation |
---|---|
bin | 110111111000010010… |
… | …0011100000110010111 |
3 | 102110202000112211101000 |
4 | 1233300210130012113 |
5 | 3431230022413421 |
6 | 131043300434343 |
7 | 11445500610510 |
oct | 1576044340627 |
9 | 373660484330 |
10 | 120000201111 |
11 | 46989a9222a |
12 | 1b30b9a89b3 |
13 | b415257a7b |
14 | 5b45399a07 |
15 | 31c4ee5226 |
hex | 1bf091c197 |
120000201111 has 32 divisors (see below), whose sum is σ = 203193835520. Its totient is φ = 68565167712.
The previous prime is 120000201109. The next prime is 120000201131. The reversal of 120000201111 is 111102000021.
It is a happy number.
It is not a de Polignac number, because 120000201111 - 21 = 120000201109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120000201093 and 120000201102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120000201131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2650581 + ... + 2695473.
It is an arithmetic number, because the mean of its divisors is an integer number (6349807360).
Almost surely, 2120000201111 is an apocalyptic number.
120000201111 is a deficient number, since it is larger than the sum of its proper divisors (83193634409).
120000201111 is a wasteful number, since it uses less digits than its factorization.
120000201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59052 (or 59046 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 120000201111 its reverse (111102000021), we get a palindrome (231102201132).
The spelling of 120000201111 in words is "one hundred twenty billion, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •