Base | Representation |
---|---|
bin | 11101010010110001111… |
… | …101010011001101011101 |
3 | 21010102222112201021001102 |
4 | 131102301331103031131 |
5 | 230440141231044404 |
6 | 4140435014122445 |
7 | 265302524330651 |
oct | 35226175231535 |
9 | 7112875637042 |
10 | 2013030331229 |
11 | 7067a3162575 |
12 | 28617b950425 |
13 | 117a9bcc5a38 |
14 | 6d607272a61 |
15 | 3756be2171e |
hex | 1d4b1f5335d |
2013030331229 has 2 divisors, whose sum is σ = 2013030331230. Its totient is φ = 2013030331228.
The previous prime is 2013030331211. The next prime is 2013030331231. The reversal of 2013030331229 is 9221330303102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1690546044100 + 322484287129 = 1300210^2 + 567877^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013030331229 - 28 = 2013030330973 is a prime.
It is a super-3 number, since 3×20130303312293 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 2013030331231, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013030331259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006515165614 + 1006515165615.
It is an arithmetic number, because the mean of its divisors is an integer number (1006515165615).
Almost surely, 22013030331229 is an apocalyptic number.
It is an amenable number.
2013030331229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013030331229 is an equidigital number, since it uses as much as digits as its factorization.
2013030331229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 2013030331229 in words is "two trillion, thirteen billion, thirty million, three hundred thirty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •