Base | Representation |
---|---|
bin | 10001101001101101001… |
… | …101011000011111110111 |
3 | 11021221222221222010011001 |
4 | 101221231031120133313 |
5 | 124333222312032411 |
6 | 2325130034224131 |
7 | 153431410253032 |
oct | 21515515303767 |
9 | 4257887863131 |
10 | 1213013002231 |
11 | 428488242298 |
12 | 17710b725047 |
13 | 8a50458c924 |
14 | 429d28ba019 |
15 | 21847359dc1 |
hex | 11a6d3587f7 |
1213013002231 has 2 divisors, whose sum is σ = 1213013002232. Its totient is φ = 1213013002230.
The previous prime is 1213013002213. The next prime is 1213013002361. The reversal of 1213013002231 is 1322003103121.
Together with previous prime (1213013002213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1213013002231 - 221 = 1213010905079 is a prime.
It is a super-2 number, since 2×12130130022312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1213013002199 and 1213013002208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213013002931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606506501115 + 606506501116.
It is an arithmetic number, because the mean of its divisors is an integer number (606506501116).
Almost surely, 21213013002231 is an apocalyptic number.
1213013002231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213013002231 is an equidigital number, since it uses as much as digits as its factorization.
1213013002231 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 1213013002231 its reverse (1322003103121), we get a palindrome (2535016105352).
The spelling of 1213013002231 in words is "one trillion, two hundred thirteen billion, thirteen million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •