Base | Representation |
---|---|
bin | 10110110000111110000101… |
… | …011110100110010011100001 |
3 | 111010111120221210121212011112 |
4 | 112300332011132212103201 |
5 | 101110400302314344001 |
6 | 552535302552553105 |
7 | 30042406666220345 |
oct | 2660760536462341 |
9 | 433446853555145 |
10 | 100122222028001 |
11 | 299a1661176878 |
12 | b2904356b2795 |
13 | 43b363c7a5184 |
14 | 1aa1d272cb625 |
15 | b8961e893cbb |
hex | 5b0f857a64e1 |
100122222028001 has 2 divisors, whose sum is σ = 100122222028002. Its totient is φ = 100122222028000.
The previous prime is 100122222027977. The next prime is 100122222028021. The reversal of 100122222028001 is 100820222221001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96927963040000 + 3194258988001 = 9845200^2 + 1787249^2 .
It is a cyclic number.
It is not a de Polignac number, because 100122222028001 - 210 = 100122222026977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (100122222028021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061111014000 + 50061111014001.
It is an arithmetic number, because the mean of its divisors is an integer number (50061111014001).
Almost surely, 2100122222028001 is an apocalyptic number.
It is an amenable number.
100122222028001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122222028001 is an equidigital number, since it uses as much as digits as its factorization.
100122222028001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 100122222028001 its reverse (100820222221001), we get a palindrome (200942444249002).
The spelling of 100122222028001 in words is "one hundred trillion, one hundred twenty-two billion, two hundred twenty-two million, twenty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •