Base | Representation |
---|---|
bin | 10110110000111101111111… |
… | …011001000110100011101101 |
3 | 111010111120200200111102201222 |
4 | 112300331333121012203231 |
5 | 101110400100200031244 |
6 | 552535244504313125 |
7 | 30042404316313034 |
oct | 2660757731064355 |
9 | 433446620442658 |
10 | 100122119923949 |
11 | 299a1609578562 |
12 | b2904074727a5 |
13 | 43b36245a5a86 |
14 | 1aa1d1790d71b |
15 | b89615925bee |
hex | 5b0f7f6468ed |
100122119923949 has 2 divisors, whose sum is σ = 100122119923950. Its totient is φ = 100122119923948.
The previous prime is 100122119923939. The next prime is 100122119923957. The reversal of 100122119923949 is 949329911221001.
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., 75220842270025 + 24901277653924 = 8672995^2 + 4990118^2 .
It is a cyclic number.
It is not a de Polignac number, because 100122119923949 - 212 = 100122119919853 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100122119923949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122119923939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061059961974 + 50061059961975.
It is an arithmetic number, because the mean of its divisors is an integer number (50061059961975).
Almost surely, 2100122119923949 is an apocalyptic number.
It is an amenable number.
100122119923949 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122119923949 is an equidigital number, since it uses as much as digits as its factorization.
100122119923949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 629856, while the sum is 53.
The spelling of 100122119923949 in words is "one hundred trillion, one hundred twenty-two billion, one hundred nineteen million, nine hundred twenty-three thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •