Base | Representation |
---|---|
bin | 1111000001010101000100… |
… | …01110110111100110110101 |
3 | 11022221201211121011012122012 |
4 | 13200222202032313212311 |
5 | 13312140012200004023 |
6 | 154130124035414005 |
7 | 6646261322064542 |
oct | 740524216674665 |
9 | 138851747135565 |
10 | 33031020313013 |
11 | a585416939058 |
12 | 3855771a54305 |
13 | 1557a72834148 |
14 | 8229d2005bc9 |
15 | 3c432c9db978 |
hex | 1e0aa23b79b5 |
33031020313013 has 2 divisors, whose sum is σ = 33031020313014. Its totient is φ = 33031020313012.
The previous prime is 33031020313009. The next prime is 33031020313043. The reversal of 33031020313013 is 31031302013033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19128875553649 + 13902144759364 = 4373657^2 + 3728558^2 .
It is a cyclic number.
It is not a de Polignac number, because 33031020313013 - 22 = 33031020313009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33031020313013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33031020313043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16515510156506 + 16515510156507.
It is an arithmetic number, because the mean of its divisors is an integer number (16515510156507).
Almost surely, 233031020313013 is an apocalyptic number.
It is an amenable number.
33031020313013 is a deficient number, since it is larger than the sum of its proper divisors (1).
33031020313013 is an equidigital number, since it uses as much as digits as its factorization.
33031020313013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 33031020313013 its reverse (31031302013033), we get a palindrome (64062322326046).
The spelling of 33031020313013 in words is "thirty-three trillion, thirty-one billion, twenty million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •