Base | Representation |
---|---|
bin | 11101011011001000110… |
… | …10111111100000001101 |
3 | 10120122120110211121212011 |
4 | 32231210122333200031 |
5 | 113031013020041023 |
6 | 2052240431541221 |
7 | 133020401106235 |
oct | 16554432774015 |
9 | 3518513747764 |
10 | 1011002112013 |
11 | 35a844376553 |
12 | 143b3268a811 |
13 | 7444c7825aa |
14 | 36d0b706cc5 |
15 | 1b4725c150d |
hex | eb646bf80d |
1011002112013 has 2 divisors, whose sum is σ = 1011002112014. Its totient is φ = 1011002112012.
The previous prime is 1011002112011. The next prime is 1011002112017. The reversal of 1011002112013 is 3102112001101.
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., 939187759689 + 71814352324 = 969117^2 + 267982^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011002112013 - 21 = 1011002112011 is a prime.
Together with 1011002112011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1011002111984 and 1011002112002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011002112011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505501056006 + 505501056007.
It is an arithmetic number, because the mean of its divisors is an integer number (505501056007).
Almost surely, 21011002112013 is an apocalyptic number.
It is an amenable number.
1011002112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011002112013 is an equidigital number, since it uses as much as digits as its factorization.
1011002112013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1011002112013 its reverse (3102112001101), we get a palindrome (4113114113114).
The spelling of 1011002112013 in words is "one trillion, eleven billion, two million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •