Base | Representation |
---|---|
bin | 11011010010001110110100… |
… | …101001010011110110000011 |
3 | 120201212220021211100211120210 |
4 | 123102032310221103312003 |
5 | 111212040222213323021 |
6 | 1103115143420005203 |
7 | 34163502614232324 |
oct | 3322166451236603 |
9 | 521786254324523 |
10 | 120000122011011 |
11 | 35265847529960 |
12 | 115609b2090803 |
13 | 51c5c697a9038 |
14 | 218c07335044b |
15 | dd172a206e76 |
hex | 6d23b4a53d83 |
120000122011011 has 128 divisors (see below), whose sum is σ = 186893084851200. Its totient is φ = 67794693120000.
The previous prime is 120000122010983. The next prime is 120000122011013. The reversal of 120000122011011 is 110110221000021.
120000122011011 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 120000122011011 - 210 = 120000122009987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120000122011013) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9419894880 + ... + 9419907618.
It is an arithmetic number, because the mean of its divisors is an integer number (1460102225400).
Almost surely, 2120000122011011 is an apocalyptic number.
120000122011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120000122011011 is a deficient number, since it is larger than the sum of its proper divisors (66892962840189).
120000122011011 is a wasteful number, since it uses less digits than its factorization.
120000122011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15301.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120000122011011 its reverse (110110221000021), we get a palindrome (230110343011032).
The spelling of 120000122011011 in words is "one hundred twenty trillion, one hundred twenty-two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •