Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …101111110111110101110001 |
3 | 111020222011122012001012010221 |
4 | 112333031233233313311301 |
5 | 101222420033130013014 |
6 | 555005113031253041 |
7 | 30203212516545316 |
oct | 2677155757676561 |
9 | 436864565035127 |
10 | 101101110001009 |
11 | 2a239815993378 |
12 | b40a0a521a181 |
13 | 4454a41b94041 |
14 | 1ad746989cd0d |
15 | ba4d1292eb24 |
hex | 5bf36fbf7d71 |
101101110001009 has 2 divisors, whose sum is σ = 101101110001010. Its totient is φ = 101101110001008.
The previous prime is 101101110000973. The next prime is 101101110001033. The reversal of 101101110001009 is 900100011101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98169018848784 + 2932091152225 = 9908028^2 + 1712335^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101110001009 - 29 = 101101110000497 is a prime.
It is a super-2 number, since 2×1011011100010092 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101101110000983 and 101101110001001.
It is not a weakly prime, because it can be changed into another prime (101101110001069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550555000504 + 50550555000505.
It is an arithmetic number, because the mean of its divisors is an integer number (50550555000505).
Almost surely, 2101101110001009 is an apocalyptic number.
It is an amenable number.
101101110001009 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101110001009 is an equidigital number, since it uses as much as digits as its factorization.
101101110001009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 101101110001009 in words is "one hundred one trillion, one hundred one billion, one hundred ten million, one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •