Base | Representation |
---|---|
bin | 10110110000111101111001… |
… | …100011100011010111111111 |
3 | 111010111120102212020101111202 |
4 | 112300331321203203113333 |
5 | 101110344400113001002 |
6 | 552535231045410115 |
7 | 30042402020055611 |
oct | 2660757143432777 |
9 | 433446385211452 |
10 | 100122022000127 |
11 | 299a1569274986 |
12 | b29039a70993b |
13 | 43b360a20b29a |
14 | 1aa1d088dcdb1 |
15 | b8960c031502 |
hex | 5b0f798e35ff |
100122022000127 has 2 divisors, whose sum is σ = 100122022000128. Its totient is φ = 100122022000126.
The previous prime is 100122022000093. The next prime is 100122022000151. The reversal of 100122022000127 is 721000220221001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100122022000127 - 232 = 100117727032831 is a prime.
It is a super-2 number, since 2×1001220220001272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100122022000099 and 100122022000108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122022000157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061011000063 + 50061011000064.
It is an arithmetic number, because the mean of its divisors is an integer number (50061011000064).
Almost surely, 2100122022000127 is an apocalyptic number.
100122022000127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122022000127 is an equidigital number, since it uses as much as digits as its factorization.
100122022000127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 100122022000127 its reverse (721000220221001), we get a palindrome (821122242221128).
The spelling of 100122022000127 in words is "one hundred trillion, one hundred twenty-two billion, twenty-two million, one hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •