Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …100011001111010011011001 |
3 | 111010002212112220100002020001 |
4 | 112233111222203033103121 |
5 | 101102031141341004402 |
6 | 552412001200333001 |
7 | 30031330352151412 |
oct | 2657255243172331 |
9 | 433085486302201 |
10 | 100010101109977 |
11 | 29959055900653 |
12 | b272764614161 |
13 | 43a5bb1a751b6 |
14 | 1a9a72c574809 |
15 | b8675b4a1187 |
hex | 5af56a8cf4d9 |
100010101109977 has 2 divisors, whose sum is σ = 100010101109978. Its totient is φ = 100010101109976.
The previous prime is 100010101109959. The next prime is 100010101109987. The reversal of 100010101109977 is 779901101010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98449040778201 + 1561060331776 = 9922149^2 + 1249424^2 .
It is an emirp because it is prime and its reverse (779901101010001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100010101109977 - 215 = 100010101077209 is a prime.
It is not a weakly prime, because it can be changed into another prime (100010101109917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005050554988 + 50005050554989.
It is an arithmetic number, because the mean of its divisors is an integer number (50005050554989).
Almost surely, 2100010101109977 is an apocalyptic number.
It is an amenable number.
100010101109977 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010101109977 is an equidigital number, since it uses as much as digits as its factorization.
100010101109977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3969, while the sum is 37.
Adding to 100010101109977 its reverse (779901101010001), we get a palindrome (879911202119978).
The spelling of 100010101109977 in words is "one hundred trillion, ten billion, one hundred one million, one hundred nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •