Base | Representation |
---|---|
bin | 100110100101001000110… |
… | …0101110100111010010001 |
3 | 200202220111121202112122021 |
4 | 1031022101211310322101 |
5 | 1143333340124140013 |
6 | 15135523113211441 |
7 | 1055042133343012 |
oct | 115122145647221 |
9 | 20686447675567 |
10 | 5302432255633 |
11 | 1764826857487 |
12 | 717791a00b81 |
13 | 2c602ba93396 |
14 | 1448d3943009 |
15 | 92ddd6c8a8d |
hex | 4d291974e91 |
5302432255633 has 2 divisors, whose sum is σ = 5302432255634. Its totient is φ = 5302432255632.
The previous prime is 5302432255613. The next prime is 5302432255651. The reversal of 5302432255633 is 3365522342035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5298522629904 + 3909625729 = 2301852^2 + 62527^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5302432255633 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5302432255633.
It is not a weakly prime, because it can be changed into another prime (5302432255613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2651216127816 + 2651216127817.
It is an arithmetic number, because the mean of its divisors is an integer number (2651216127817).
Almost surely, 25302432255633 is an apocalyptic number.
It is an amenable number.
5302432255633 is a deficient number, since it is larger than the sum of its proper divisors (1).
5302432255633 is an equidigital number, since it uses as much as digits as its factorization.
5302432255633 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944000, while the sum is 43.
Adding to 5302432255633 its reverse (3365522342035), we get a palindrome (8667954597668).
The spelling of 5302432255633 in words is "five trillion, three hundred two billion, four hundred thirty-two million, two hundred fifty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •