Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001011101111010110011001 |
3 | 111020222001210112012212011112 |
4 | 112333030232023233112121 |
5 | 101222410310030310014 |
6 | 555004411534510105 |
7 | 30203143332020423 |
oct | 2677145613572631 |
9 | 436861715185145 |
10 | 101100010010009 |
11 | 2a239300a848aa |
12 | b409a38965335 |
13 | 44548c80174aa |
14 | 1ad73a3763813 |
15 | ba4c9b09b73e |
hex | 5bf32e2ef599 |
101100010010009 has 2 divisors, whose sum is σ = 101100010010010. Its totient is φ = 101100010010008.
The previous prime is 101100010009981. The next prime is 101100010010039. The reversal of 101100010010009 is 900010010001101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57209981257984 + 43890028752025 = 7563728^2 + 6624955^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100010010009 - 228 = 101099741574553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100010009975 and 101100010010002.
It is not a weakly prime, because it can be changed into another prime (101100010010039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550005005004 + 50550005005005.
It is an arithmetic number, because the mean of its divisors is an integer number (50550005005005).
Almost surely, 2101100010010009 is an apocalyptic number.
It is an amenable number.
101100010010009 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100010010009 is an equidigital number, since it uses as much as digits as its factorization.
101100010010009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 101100010010009 in words is "one hundred one trillion, one hundred billion, ten million, ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •