Base | Representation |
---|---|
bin | 10110110000111110000101… |
… | …010110110101000000001001 |
3 | 111010111120221122210100222212 |
4 | 112300332011112311000021 |
5 | 101110400301304203144 |
6 | 552535302441154505 |
7 | 30042406643004614 |
oct | 2660760526650011 |
9 | 433446848710885 |
10 | 100122219991049 |
11 | 299a1660005443 |
12 | b290434a8ba35 |
13 | 43b363c240c89 |
14 | 1aa1d26d1b17b |
15 | b8961e5e049e |
hex | 5b0f855b5009 |
100122219991049 has 2 divisors, whose sum is σ = 100122219991050. Its totient is φ = 100122219991048.
The previous prime is 100122219991033. The next prime is 100122219991063. The reversal of 100122219991049 is 940199912221001.
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., 60509231597824 + 39612988393225 = 7778768^2 + 6293885^2 .
It is a cyclic number.
It is not a de Polignac number, because 100122219991049 - 24 = 100122219991033 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100122219990988 and 100122219991006.
It is not a weakly prime, because it can be changed into another prime (100122219991009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061109995524 + 50061109995525.
It is an arithmetic number, because the mean of its divisors is an integer number (50061109995525).
Almost surely, 2100122219991049 is an apocalyptic number.
It is an amenable number.
100122219991049 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122219991049 is an equidigital number, since it uses as much as digits as its factorization.
100122219991049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 50.
The spelling of 100122219991049 in words is "one hundred trillion, one hundred twenty-two billion, two hundred nineteen million, nine hundred ninety-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •