Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …000010010001101101110001 |
3 | 111010111101012221111201001001 |
4 | 112300330001002101231301 |
5 | 101110331230000323441 |
6 | 552534254255242001 |
7 | 30042300635332126 |
oct | 2660740102215561 |
9 | 433441187451031 |
10 | 100120000011121 |
11 | 299a0720979692 |
12 | b28bb15519301 |
13 | 43b337733539c |
14 | 1aa1b9615c74d |
15 | b8953e778731 |
hex | 5b0f01091b71 |
100120000011121 has 2 divisors, whose sum is σ = 100120000011122. Its totient is φ = 100120000011120.
The previous prime is 100120000011047. The next prime is 100120000011127. The reversal of 100120000011121 is 121110000021001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78061112448400 + 22058887562721 = 8835220^2 + 4696689^2 .
It is a cyclic number.
It is not a de Polignac number, because 100120000011121 - 225 = 100119966456689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100120000011098 and 100120000011107.
It is not a weakly prime, because it can be changed into another prime (100120000011127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060000005560 + 50060000005561.
It is an arithmetic number, because the mean of its divisors is an integer number (50060000005561).
Almost surely, 2100120000011121 is an apocalyptic number.
It is an amenable number.
100120000011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120000011121 is an equidigital number, since it uses as much as digits as its factorization.
100120000011121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100120000011121 its reverse (121110000021001), we get a palindrome (221230000032122).
The spelling of 100120000011121 in words is "one hundred trillion, one hundred twenty billion, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •