Base | Representation |
---|---|
bin | 100110111100011010100… |
… | …0111101010101100001101 |
3 | 200221200112101101002021111 |
4 | 1031320311013222230031 |
5 | 1200143224114000013 |
6 | 15214511253532021 |
7 | 1061461653121105 |
oct | 115706507525415 |
9 | 20850471332244 |
10 | 5352420453133 |
11 | 1783a488990a6 |
12 | 725402944011 |
13 | 2ca96725cc80 |
14 | 1470b6880205 |
15 | 94366edb73d |
hex | 4de351eab0d |
5352420453133 has 12 divisors (see below), whose sum is σ = 6123157605460. Its totient is φ = 4650066634752.
The previous prime is 5352420453119. The next prime is 5352420453203. The reversal of 5352420453133 is 3313540242535.
It can be written as a sum of positive squares in 6 ways, for example, as 323690447844 + 5028730005289 = 568938^2 + 2242483^2 .
It is not a de Polignac number, because 5352420453133 - 217 = 5352420322061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5352420453833) 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 in 11 ways as a sum of consecutive naturals, for example, 712322628 + ... + 712330141.
Almost surely, 25352420453133 is an apocalyptic number.
It is an amenable number.
5352420453133 is a deficient number, since it is larger than the sum of its proper divisors (770737152327).
5352420453133 is a wasteful number, since it uses less digits than its factorization.
5352420453133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1424652816 (or 1424652799 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 40.
Adding to 5352420453133 its reverse (3313540242535), we get a palindrome (8665960695668).
The spelling of 5352420453133 in words is "five trillion, three hundred fifty-two billion, four hundred twenty million, four hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •