Base | Representation |
---|---|
bin | 10110101111100100100010… |
… | …000001101100101101110111 |
3 | 111010011101202101202110100112 |
4 | 112233210202001230231313 |
5 | 101102311334420232231 |
6 | 552423201201333235 |
7 | 30032434055335634 |
oct | 2657444201545567 |
9 | 433141671673315 |
10 | 100026064227191 |
11 | 299648a7644903 |
12 | b27587a63721b |
13 | 43a7556cb669b |
14 | 1a9b40466518b |
15 | b86d92b0d92b |
hex | 5af92206cb77 |
100026064227191 has 2 divisors, whose sum is σ = 100026064227192. Its totient is φ = 100026064227190.
The previous prime is 100026064227169. The next prime is 100026064227197. The reversal of 100026064227191 is 191722460620001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100026064227191 - 230 = 100024990485367 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 (100026064227197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50013032113595 + 50013032113596.
It is an arithmetic number, because the mean of its divisors is an integer number (50013032113596).
Almost surely, 2100026064227191 is an apocalyptic number.
100026064227191 is a deficient number, since it is larger than the sum of its proper divisors (1).
100026064227191 is an equidigital number, since it uses as much as digits as its factorization.
100026064227191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 41.
The spelling of 100026064227191 in words is "one hundred trillion, twenty-six billion, sixty-four million, two hundred twenty-seven thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •