Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01100000011111001101 |
3 | 10112121011210111220212201 |
4 | 32203110231200133031 |
5 | 112341000241041023 |
6 | 2043221050201501 |
7 | 132150650130031 |
oct | 16432455403715 |
9 | 3477153456781 |
10 | 1000001112013 |
11 | 356109615412 |
12 | 141982423291 |
13 | 733b8597a37 |
14 | 365866561c1 |
15 | 1b02b8d5bad |
hex | e8d4b607cd |
1000001112013 has 2 divisors, whose sum is σ = 1000001112014. Its totient is φ = 1000001112012.
The previous prime is 1000001112001. The next prime is 1000001112017. The reversal of 1000001112013 is 3102111000001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 743806203364 + 256194908649 = 862442^2 + 506157^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000001112013 - 25 = 1000001111981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000001112017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500000556006 + 500000556007.
It is an arithmetic number, because the mean of its divisors is an integer number (500000556007).
Almost surely, 21000001112013 is an apocalyptic number.
It is an amenable number.
1000001112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000001112013 is an equidigital number, since it uses as much as digits as its factorization.
1000001112013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1000001112013 its reverse (3102111000001), we get a palindrome (4102112112014).
The spelling of 1000001112013 in words is "one trillion, one million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •