Base | Representation |
---|---|
bin | 110111111011010100… |
… | …1010001000110111111 |
3 | 102111000010100100200011 |
4 | 1233312221101012333 |
5 | 3431432121130421 |
6 | 131101341244051 |
7 | 11451146155555 |
oct | 1576651210677 |
9 | 374003310604 |
10 | 120102130111 |
11 | 46a31580a77 |
12 | 1b339b63627 |
13 | b4303c55a2 |
14 | 5b54b2dbd5 |
15 | 31cde2b4e1 |
hex | 1bf6a511bf |
120102130111 has 4 divisors (see below), whose sum is σ = 127166961312. Its totient is φ = 113037298912.
The previous prime is 120102130103. The next prime is 120102130121. The reversal of 120102130111 is 111031201021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120102130111 - 23 = 120102130103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120102130091 and 120102130100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120102130121) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3532415575 + ... + 3532415608.
It is an arithmetic number, because the mean of its divisors is an integer number (31791740328).
Almost surely, 2120102130111 is an apocalyptic number.
120102130111 is a deficient number, since it is larger than the sum of its proper divisors (7064831201).
120102130111 is an equidigital number, since it uses as much as digits as its factorization.
120102130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7064831200.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 120102130111 its reverse (111031201021), we get a palindrome (231133331132).
The spelling of 120102130111 in words is "one hundred twenty billion, one hundred two million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •