Base | Representation |
---|---|
bin | 110111111000010001… |
… | …1101111111000101011 |
3 | 102110202000012121221121 |
4 | 1233300203233320223 |
5 | 3431230001120021 |
6 | 131043252520111 |
7 | 11445466224514 |
oct | 1576043577053 |
9 | 373660177847 |
10 | 120000020011 |
11 | 46989979163 |
12 | 1b30b920037 |
13 | b4151c3501 |
14 | 5b4534da0b |
15 | 31c4eab741 |
hex | 1bf08efe2b |
120000020011 has 4 divisors (see below), whose sum is σ = 120001858000. Its totient is φ = 119998182024.
The previous prime is 120000020009. The next prime is 120000020047. The reversal of 120000020011 is 110020000021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110020000021 = 53 ⋅2075849057.
It is a cyclic number.
It is not a de Polignac number, because 120000020011 - 21 = 120000020009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120000019976 and 120000020003.
It is not an unprimeable number, because it can be changed into a prime (120000020081) 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, 817311 + ... + 952888.
It is an arithmetic number, because the mean of its divisors is an integer number (30000464500).
Almost surely, 2120000020011 is an apocalyptic number.
120000020011 is a deficient number, since it is larger than the sum of its proper divisors (1837989).
120000020011 is an equidigital number, since it uses as much as digits as its factorization.
120000020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837988.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 120000020011 its reverse (110020000021), we get a palindrome (230020020032).
The spelling of 120000020011 in words is "one hundred twenty billion, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •