Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …11001110110111100001 |
3 | 10112121012111010100110002 |
4 | 32203111103032313201 |
5 | 112341010304020223 |
6 | 2043222042145345 |
7 | 132151130155562 |
oct | 16432523166741 |
9 | 3477174110402 |
10 | 1000011001313 |
11 | 35611415a395 |
12 | 1419857b2255 |
13 | 733ba64b0ac |
14 | 36587aac169 |
15 | 1b02c6dae28 |
hex | e8d54cede1 |
1000011001313 has 2 divisors, whose sum is σ = 1000011001314. Its totient is φ = 1000011001312.
The previous prime is 1000011001273. The next prime is 1000011001331. The reversal of 1000011001313 is 3131001100001.
It is a happy number.
Together with next prime (1000011001331) 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., 755216617024 + 244794384289 = 869032^2 + 494767^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000011001313 - 212 = 1000010997217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000011001294 and 1000011001303.
It is not a weakly prime, because it can be changed into another prime (1000011021313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500005500656 + 500005500657.
It is an arithmetic number, because the mean of its divisors is an integer number (500005500657).
Almost surely, 21000011001313 is an apocalyptic number.
It is an amenable number.
1000011001313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000011001313 is an equidigital number, since it uses as much as digits as its factorization.
1000011001313 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 11.
Adding to 1000011001313 its reverse (3131001100001), we get a palindrome (4131012101314).
The spelling of 1000011001313 in words is "one trillion, eleven million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •