Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01000111100101011101 |
3 | 10112121011210022201221221 |
4 | 32203110231013211131 |
5 | 112341000224310023 |
6 | 2043221044053341 |
7 | 132150646223455 |
oct | 16432455074535 |
9 | 3477153281857 |
10 | 1000001010013 |
11 | 356109555815 |
12 | 141982394251 |
13 | 733b8560495 |
14 | 3658662ad65 |
15 | 1b02b8b585d |
hex | e8d4b4795d |
1000001010013 has 2 divisors, whose sum is σ = 1000001010014. Its totient is φ = 1000001010012.
The previous prime is 1000001009983. The next prime is 1000001010031. The reversal of 1000001010013 is 3100101000001.
It is a happy number.
Together with next prime (1000001010031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 602731744164 + 397269265849 = 776358^2 + 630293^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000001010013 - 25 = 1000001009981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000001009978 and 1000001010005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000001010083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500000505006 + 500000505007.
It is an arithmetic number, because the mean of its divisors is an integer number (500000505007).
Almost surely, 21000001010013 is an apocalyptic number.
It is an amenable number.
1000001010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000001010013 is an equidigital number, since it uses as much as digits as its factorization.
1000001010013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 1000001010013 its reverse (3100101000001), we get a palindrome (4100102010014).
The spelling of 1000001010013 in words is "one trillion, one million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •