Base | Representation |
---|---|
bin | 101110110011001000… |
… | …1000111010000001101 |
3 | 100121102000111111000111 |
4 | 1131212101013100031 |
5 | 3121311000304442 |
6 | 114100304000021 |
7 | 10155324663412 |
oct | 1354621072015 |
9 | 317360444014 |
10 | 100500009997 |
11 | 396926aa002 |
12 | 17589300011 |
13 | 962829924a |
14 | 4c1561a109 |
15 | 29330a5b17 |
hex | 176644740d |
100500009997 has 2 divisors, whose sum is σ = 100500009998. Its totient is φ = 100500009996.
The previous prime is 100500009979. The next prime is 100500010001. The reversal of 100500009997 is 799900005001.
Together with previous prime (100500009979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79675788361 + 20824221636 = 282269^2 + 144306^2 .
It is a cyclic number.
It is not a de Polignac number, because 100500009997 - 227 = 100365792269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100500009497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50250004998 + 50250004999.
It is an arithmetic number, because the mean of its divisors is an integer number (50250004999).
Almost surely, 2100500009997 is an apocalyptic number.
It is an amenable number.
100500009997 is a deficient number, since it is larger than the sum of its proper divisors (1).
100500009997 is an equidigital number, since it uses as much as digits as its factorization.
100500009997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25515, while the sum is 40.
The spelling of 100500009997 in words is "one hundred billion, five hundred million, nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •