Base | Representation |
---|---|
bin | 11101010010110001010… |
… | …111000010101110010111 |
3 | 21010102221211211201212001 |
4 | 131102301113002232113 |
5 | 230440131144132411 |
6 | 4140434015140131 |
7 | 265302343150621 |
oct | 35226127025627 |
9 | 7112854751761 |
10 | 2013020302231 |
11 | 706798532644 |
12 | 286178514647 |
13 | 117a99bc3c13 |
14 | 6d605bc1c11 |
15 | 3756b0dedc1 |
hex | 1d4b15c2b97 |
2013020302231 has 2 divisors, whose sum is σ = 2013020302232. Its totient is φ = 2013020302230.
The previous prime is 2013020302213. The next prime is 2013020302277. The reversal of 2013020302231 is 1322030203102.
Together with previous prime (2013020302213) 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 2013020302231 - 27 = 2013020302103 is a prime.
It is a super-2 number, since 2×20130203022312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2013020302199 and 2013020302208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013020302331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006510151115 + 1006510151116.
It is an arithmetic number, because the mean of its divisors is an integer number (1006510151116).
Almost surely, 22013020302231 is an apocalyptic number.
2013020302231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013020302231 is an equidigital number, since it uses as much as digits as its factorization.
2013020302231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2013020302231 its reverse (1322030203102), we get a palindrome (3335050505333).
The spelling of 2013020302231 in words is "two trillion, thirteen billion, twenty million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •