Base | Representation |
---|---|
bin | 100101001100100100000… |
… | …1000101101100001101111 |
3 | 200002201112111100010102020 |
4 | 1022121020020231201233 |
5 | 1132224312124403143 |
6 | 14512304433001223 |
7 | 1035226416201042 |
oct | 112311010554157 |
9 | 20081474303366 |
10 | 5112221325423 |
11 | 16a1098732303 |
12 | 6a69486b3213 |
13 | 2b110784b2c4 |
14 | 13960b998c59 |
15 | 8cea9849883 |
hex | 4a64822d86f |
5112221325423 has 16 divisors (see below), whose sum is σ = 6826068329472. Its totient is φ = 3403263248000.
The previous prime is 5112221325383. The next prime is 5112221325443. The reversal of 5112221325423 is 3245231222115.
It is a cyclic number.
It is not a de Polignac number, because 5112221325423 - 220 = 5112220276847 is a prime.
It is a super-2 number, since 2×51122213254232 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5112221325443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8622658 + ... + 9196448.
It is an arithmetic number, because the mean of its divisors is an integer number (426629270592).
Almost surely, 25112221325423 is an apocalyptic number.
5112221325423 is a deficient number, since it is larger than the sum of its proper divisors (1713847004049).
5112221325423 is a wasteful number, since it uses less digits than its factorization.
5112221325423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578046.
The product of its digits is 28800, while the sum is 33.
Adding to 5112221325423 its reverse (3245231222115), we get a palindrome (8357452547538).
The spelling of 5112221325423 in words is "five trillion, one hundred twelve billion, two hundred twenty-one million, three hundred twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •