Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …001110111111110011101001 |
3 | 111020122110110122120110211012 |
4 | 112331320321032333303221 |
5 | 101214421440240200014 |
6 | 554455204235313305 |
7 | 30163505663634251 |
oct | 2675707116776351 |
9 | 436573418513735 |
10 | 101010001100009 |
11 | 2a204112328581 |
12 | b3b44b8bab835 |
13 | 44492823c5831 |
14 | 1ad2ca55c6961 |
15 | ba277e05ec3e |
hex | 5bde393bfce9 |
101010001100009 has 2 divisors, whose sum is σ = 101010001100010. Its totient is φ = 101010001100008.
The previous prime is 101010001099949. The next prime is 101010001100033. The reversal of 101010001100009 is 900001100010101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74372893056784 + 26637108043225 = 8623972^2 + 5161115^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101010001100009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101010001099966 and 101010001100002.
It is not a weakly prime, because it can be changed into another prime (101010001100059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505000550004 + 50505000550005.
It is an arithmetic number, because the mean of its divisors is an integer number (50505000550005).
Almost surely, 2101010001100009 is an apocalyptic number.
It is an amenable number.
101010001100009 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010001100009 is an equidigital number, since it uses as much as digits as its factorization.
101010001100009 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 101010001100009 in words is "one hundred one trillion, ten billion, one million, one hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •