Base | Representation |
---|---|
bin | 11011010010011001111001… |
… | …010110011100000010111011 |
3 | 120201221000222110200110002211 |
4 | 123102121321112130002323 |
5 | 111212234100100010021 |
6 | 1103124431322035551 |
7 | 34164403352346100 |
oct | 3322317126340273 |
9 | 521830873613084 |
10 | 120012012110011 |
11 | 3526a89914725a |
12 | 11563170048bb7 |
13 | 51c7112c41588 |
14 | 218c880520aa7 |
15 | dd1bc3eb93e1 |
hex | 6d267959c0bb |
120012012110011 has 12 divisors (see below), whose sum is σ = 139628338325568. Its totient is φ = 102850839136752.
The previous prime is 120012012109973. The next prime is 120012012110027. The reversal of 120012012110011 is 110011210210021.
It is a happy number.
It is not a de Polignac number, because 120012012110011 - 221 = 120012010012859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120012012109973 and 120012012110000.
It is not an unprimeable number, because it can be changed into a prime (120012012110041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 197310091 + ... + 197917396.
It is an arithmetic number, because the mean of its divisors is an integer number (11635694860464).
Almost surely, 2120012012110011 is an apocalyptic number.
120012012110011 is a deficient number, since it is larger than the sum of its proper divisors (19616326215557).
120012012110011 is an equidigital number, since it uses as much as digits as its factorization.
120012012110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395233698 (or 395233691 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120012012110011 its reverse (110011210210021), we get a palindrome (230023222320032).
The spelling of 120012012110011 in words is "one hundred twenty trillion, twelve billion, twelve million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •