Base | Representation |
---|---|
bin | 110111111011010100… |
… | …0110100010001101011 |
3 | 102111000010010100200002 |
4 | 1233312220310101223 |
5 | 3431432103341021 |
6 | 131101334533215 |
7 | 11451145154342 |
oct | 1576650642153 |
9 | 374003110602 |
10 | 120102012011 |
11 | 46a31500273 |
12 | 1b339b0720b |
13 | b4303838c7 |
14 | 5b54adcb59 |
15 | 31cde0650b |
hex | 1bf6a3446b |
120102012011 has 4 divisors (see below), whose sum is σ = 120102727800. Its totient is φ = 120101296224.
The previous prime is 120102011983. The next prime is 120102012061. The reversal of 120102012011 is 110210201021.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 110210201021 = 619 ⋅178045559.
It is a cyclic number.
It is not a de Polignac number, because 120102012011 - 226 = 120034903147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120102011983 and 120102012001.
It is not an unprimeable number, because it can be changed into a prime (120102012061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44900 + ... + 492158.
It is an arithmetic number, because the mean of its divisors is an integer number (30025681950).
Almost surely, 2120102012011 is an apocalyptic number.
120102012011 is a deficient number, since it is larger than the sum of its proper divisors (715789).
120102012011 is an equidigital number, since it uses as much as digits as its factorization.
120102012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715788.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120102012011 its reverse (110210201021), we get a palindrome (230312213032).
The spelling of 120102012011 in words is "one hundred twenty billion, one hundred two million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •