Base | Representation |
---|---|
bin | 100100100111110100011… |
… | …0101101110001010110101 |
3 | 122211011212020120222020002 |
4 | 1021033220311232022311 |
5 | 1124431211123203334 |
6 | 14412134435521045 |
7 | 1026434122305053 |
oct | 111175065561265 |
9 | 18734766528202 |
10 | 5033313100469 |
11 | 1670686032a55 |
12 | 6935a6459185 |
13 | 2a6840977534 |
14 | 135883c1b1d3 |
15 | 8addc139b7e |
hex | 493e8d6e2b5 |
5033313100469 has 2 divisors, whose sum is σ = 5033313100470. Its totient is φ = 5033313100468.
The previous prime is 5033313100463. The next prime is 5033313100489. The reversal of 5033313100469 is 9640013133305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5016390472900 + 16922627569 = 2239730^2 + 130087^2 .
It is a cyclic number.
It is not a de Polignac number, because 5033313100469 - 212 = 5033313096373 is a prime.
It is a super-2 number, since 2×50333131004692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5033313100463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2516656550234 + 2516656550235.
It is an arithmetic number, because the mean of its divisors is an integer number (2516656550235).
Almost surely, 25033313100469 is an apocalyptic number.
It is an amenable number.
5033313100469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5033313100469 is an equidigital number, since it uses as much as digits as its factorization.
5033313100469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 38.
The spelling of 5033313100469 in words is "five trillion, thirty-three billion, three hundred thirteen million, one hundred thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •