Base | Representation |
---|---|
bin | 100100110110010101010… |
… | …0111110001010001000101 |
3 | 122221011022102110020210122 |
4 | 1021230222213301101011 |
5 | 1130434024231313334 |
6 | 14434331331031325 |
7 | 1031616400362053 |
oct | 111545247612105 |
9 | 18834272406718 |
10 | 5064481510469 |
11 | 168291a866787 |
12 | 69964473b545 |
13 | 2a976a1231a4 |
14 | 13719d4d11d3 |
15 | 8bb1360e32e |
hex | 49b2a9f1445 |
5064481510469 has 2 divisors, whose sum is σ = 5064481510470. Its totient is φ = 5064481510468.
The previous prime is 5064481510447. The next prime is 5064481510481. The reversal of 5064481510469 is 9640151844605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3680788057444 + 1383693453025 = 1918538^2 + 1176305^2 .
It is a cyclic number.
It is not a de Polignac number, because 5064481510469 - 28 = 5064481510213 is a prime.
It is a super-2 number, since 2×50644815104692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5064481510469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5064481510499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2532240755234 + 2532240755235.
It is an arithmetic number, because the mean of its divisors is an integer number (2532240755235).
Almost surely, 25064481510469 is an apocalyptic number.
It is an amenable number.
5064481510469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5064481510469 is an equidigital number, since it uses as much as digits as its factorization.
5064481510469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4147200, while the sum is 53.
The spelling of 5064481510469 in words is "five trillion, sixty-four billion, four hundred eighty-one million, five hundred ten thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •