Base | Representation |
---|---|
bin | 100100110111001001001… |
… | …011111111101000111101 |
3 | 22222011101212102211020012 |
4 | 210313021023333220331 |
5 | 313000302420231023 |
6 | 5215410054033005 |
7 | 351003566050502 |
oct | 44671113775075 |
9 | 8864355384205 |
10 | 2533111102013 |
11 | 8973171a72a8 |
12 | 34ab25948765 |
13 | 154b4348b5ab |
14 | 8a8633a54a9 |
15 | 45d5a927978 |
hex | 24dc92ffa3d |
2533111102013 has 2 divisors, whose sum is σ = 2533111102014. Its totient is φ = 2533111102012.
The previous prime is 2533111102009. The next prime is 2533111102037. The reversal of 2533111102013 is 3102011113352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2326607203684 + 206503898329 = 1525322^2 + 454427^2 .
It is a cyclic number.
It is not a de Polignac number, because 2533111102013 - 22 = 2533111102009 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2533111102013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2533111102073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1266555551006 + 1266555551007.
It is an arithmetic number, because the mean of its divisors is an integer number (1266555551007).
Almost surely, 22533111102013 is an apocalyptic number.
It is an amenable number.
2533111102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2533111102013 is an equidigital number, since it uses as much as digits as its factorization.
2533111102013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 2533111102013 its reverse (3102011113352), we get a palindrome (5635122215365).
The spelling of 2533111102013 in words is "two trillion, five hundred thirty-three billion, one hundred eleven million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •