Base | Representation |
---|---|
bin | 100110011110110001101… |
… | …1001110100110011000101 |
3 | 200201121020122102210201022 |
4 | 1030331203121310303011 |
5 | 1143122401222034441 |
6 | 15125343432240525 |
7 | 1054046466064124 |
oct | 114754331646305 |
9 | 20647218383638 |
10 | 5288772455621 |
11 | 1759a5719a566 |
12 | 714bbb240145 |
13 | 2c4962ab8b95 |
14 | 143d99705abb |
15 | 9288e39584b |
hex | 4cf63674cc5 |
5288772455621 has 2 divisors, whose sum is σ = 5288772455622. Its totient is φ = 5288772455620.
The previous prime is 5288772455609. The next prime is 5288772455671. The reversal of 5288772455621 is 1265542778825.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3072872267521 + 2215900188100 = 1752961^2 + 1488590^2 .
It is a cyclic number.
It is not a de Polignac number, because 5288772455621 - 218 = 5288772193477 is a prime.
It is a super-2 number, since 2×52887724556212 (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 (5288772455671) 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, 2644386227810 + 2644386227811.
It is an arithmetic number, because the mean of its divisors is an integer number (2644386227811).
Almost surely, 25288772455621 is an apocalyptic number.
It is an amenable number.
5288772455621 is a deficient number, since it is larger than the sum of its proper divisors (1).
5288772455621 is an equidigital number, since it uses as much as digits as its factorization.
5288772455621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75264000, while the sum is 62.
The spelling of 5288772455621 in words is "five trillion, two hundred eighty-eight billion, seven hundred seventy-two million, four hundred fifty-five thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •