Base | Representation |
---|---|
bin | 11101010010111100010… |
… | …001100101100001000101 |
3 | 21010110102121102010221001 |
4 | 131102330101211201011 |
5 | 230441020033440003 |
6 | 4140504120053301 |
7 | 265310025506413 |
oct | 35227421454105 |
9 | 7113377363831 |
10 | 2013203421253 |
11 | 706881935682 |
12 | 286209904231 |
13 | 117ac8b1a67b |
14 | 6d62224c2b3 |
15 | 3757c21261d |
hex | 1d4bc465845 |
2013203421253 has 2 divisors, whose sum is σ = 2013203421254. Its totient is φ = 2013203421252.
The previous prime is 2013203421239. The next prime is 2013203421263. The reversal of 2013203421253 is 3521243023102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1155575550529 + 857627870724 = 1074977^2 + 926082^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013203421253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013203421233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006601710626 + 1006601710627.
It is an arithmetic number, because the mean of its divisors is an integer number (1006601710627).
Almost surely, 22013203421253 is an apocalyptic number.
It is an amenable number.
2013203421253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013203421253 is an equidigital number, since it uses as much as digits as its factorization.
2013203421253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 2013203421253 its reverse (3521243023102), we get a palindrome (5534446444355).
The spelling of 2013203421253 in words is "two trillion, thirteen billion, two hundred three million, four hundred twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •