Base | Representation |
---|---|
bin | 10001101001101101101… |
… | …001010001000111001101 |
3 | 11021222000110201111021201 |
4 | 101221231221101013031 |
5 | 124333231144441023 |
6 | 2325130455025501 |
7 | 153431526346246 |
oct | 21515551210715 |
9 | 4258013644251 |
10 | 1213020312013 |
11 | 428491385234 |
12 | 17711206b291 |
13 | 8a505c4bb43 |
14 | 429d385dccd |
15 | 21847d00bad |
hex | 11a6da511cd |
1213020312013 has 2 divisors, whose sum is σ = 1213020312014. Its totient is φ = 1213020312012.
The previous prime is 1213020312011. The next prime is 1213020312043. The reversal of 1213020312013 is 3102130203121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 845835214249 + 367185097764 = 919693^2 + 605958^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213020312013 - 21 = 1213020312011 is a prime.
It is a super-2 number, since 2×12130203120132 (a number of 25 digits) contains 22 as substring.
Together with 1213020312011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213020312011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606510156006 + 606510156007.
It is an arithmetic number, because the mean of its divisors is an integer number (606510156007).
Almost surely, 21213020312013 is an apocalyptic number.
It is an amenable number.
1213020312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213020312013 is an equidigital number, since it uses as much as digits as its factorization.
1213020312013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1213020312013 its reverse (3102130203121), we get a palindrome (4315150515134).
The spelling of 1213020312013 in words is "one trillion, two hundred thirteen billion, twenty million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •