Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1111011100010101101 |
3 | 100120010020201022220102 |
4 | 1131020201323202231 |
5 | 3114300240230442 |
6 | 113535002400445 |
7 | 10140056225216 |
oct | 1351041734255 |
9 | 316106638812 |
10 | 100001101997 |
11 | 39457019045 |
12 | 1746a200125 |
13 | 9578b07204 |
14 | 4ba926a40d |
15 | 29043a6232 |
hex | 174887b8ad |
100001101997 has 2 divisors, whose sum is σ = 100001101998. Its totient is φ = 100001101996.
The previous prime is 100001101961. The next prime is 100001102017. The reversal of 100001101997 is 799101100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96456209476 + 3544892521 = 310574^2 + 59539^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001101997 - 26 = 100001101933 is a prime.
It is a super-2 number, since 2×1000011019972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001101927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000550998 + 50000550999.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550999).
Almost surely, 2100001101997 is an apocalyptic number.
It is an amenable number.
100001101997 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001101997 is an equidigital number, since it uses as much as digits as its factorization.
100001101997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 29.
Adding to 100001101997 its reverse (799101100001), we get a palindrome (899102201998).
The spelling of 100001101997 in words is "one hundred billion, one million, one hundred one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •