Base | Representation |
---|---|
bin | 11101010010110000101… |
… | …111110110111011011101 |
3 | 21010102221010111212102012 |
4 | 131102300233312323131 |
5 | 230440121031432201 |
6 | 4140433011041005 |
7 | 265302156636404 |
oct | 35226057667335 |
9 | 7112833455365 |
10 | 2013010030301 |
11 | 706792757146 |
12 | 286174ba0165 |
13 | 117a97a3865a |
14 | 6d6046aa63b |
15 | 3756a2615bb |
hex | 1d4b0bf6edd |
2013010030301 has 2 divisors, whose sum is σ = 2013010030302. Its totient is φ = 2013010030300.
The previous prime is 2013010030277. The next prime is 2013010030303. The reversal of 2013010030301 is 1030300103102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1897478700100 + 115531330201 = 1377490^2 + 339899^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013010030301 is a prime.
It is a super-3 number, since 3×20130100303013 (a number of 38 digits) contains 333 as substring.
Together with 2013010030303, 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 (2013010030303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006505015150 + 1006505015151.
It is an arithmetic number, because the mean of its divisors is an integer number (1006505015151).
Almost surely, 22013010030301 is an apocalyptic number.
It is an amenable number.
2013010030301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013010030301 is an equidigital number, since it uses as much as digits as its factorization.
2013010030301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 2013010030301 its reverse (1030300103102), we get a palindrome (3043310133403).
The spelling of 2013010030301 in words is "two trillion, thirteen billion, ten million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •