Base | Representation |
---|---|
bin | 10110110011101110110101… |
… | …010000100101010001100111 |
3 | 111011011201210220112120020102 |
4 | 112303232311100211101213 |
5 | 101122002440032034114 |
6 | 553202410405054315 |
7 | 30062205633232211 |
oct | 2663566520452147 |
9 | 434151726476212 |
10 | 100312002221159 |
11 | 29a65099141913 |
12 | b30117a6b739b |
13 | 43c84c5706361 |
14 | 1aab1abd8d5b1 |
15 | b8e52a9dc2de |
hex | 5b3bb5425467 |
100312002221159 has 2 divisors, whose sum is σ = 100312002221160. Its totient is φ = 100312002221158.
The previous prime is 100312002221089. The next prime is 100312002221203. The reversal of 100312002221159 is 951122200213001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100312002221159 - 232 = 100307707253863 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100312002281159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50156001110579 + 50156001110580.
It is an arithmetic number, because the mean of its divisors is an integer number (50156001110580).
Almost surely, 2100312002221159 is an apocalyptic number.
100312002221159 is a deficient number, since it is larger than the sum of its proper divisors (1).
100312002221159 is an equidigital number, since it uses as much as digits as its factorization.
100312002221159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The spelling of 100312002221159 in words is "one hundred trillion, three hundred twelve billion, two million, two hundred twenty-one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •