Base | Representation |
---|---|
bin | 100101001100100011110… |
… | …1010000110110000000111 |
3 | 200002201111221020111201202 |
4 | 1022121013222012300013 |
5 | 1132224303101133104 |
6 | 14512303545013115 |
7 | 1035226261043666 |
oct | 112310752066007 |
9 | 20081457214652 |
10 | 5112213302279 |
11 | 16a1094152406 |
12 | 6a6945a8419b |
13 | 2b1105c9c495 |
14 | 13960a8aaddd |
15 | 8cea8cb251e |
hex | 4a647a86c07 |
5112213302279 has 2 divisors, whose sum is σ = 5112213302280. Its totient is φ = 5112213302278.
The previous prime is 5112213302269. The next prime is 5112213302311. The reversal of 5112213302279 is 9722033122115.
It is a happy number.
5112213302279 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5112213302279 - 216 = 5112213236743 is a prime.
It is a super-2 number, since 2×51122133022792 (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 (5112213302269) 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 as a sum of consecutive naturals, namely, 2556106651139 + 2556106651140.
It is an arithmetic number, because the mean of its divisors is an integer number (2556106651140).
Almost surely, 25112213302279 is an apocalyptic number.
5112213302279 is a deficient number, since it is larger than the sum of its proper divisors (1).
5112213302279 is an equidigital number, since it uses as much as digits as its factorization.
5112213302279 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 5112213302279 in words is "five trillion, one hundred twelve billion, two hundred thirteen million, three hundred two thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •