Base | Representation |
---|---|
bin | 111011001001110101100… |
… | …1010101100001111110101 |
3 | 1001210020000022200020211112 |
4 | 1312103223022230033311 |
5 | 2031200242013304334 |
6 | 25142514204244405 |
7 | 1466242364102051 |
oct | 166235312541765 |
9 | 31706008606745 |
10 | 8130023572469 |
11 | 2654a183a2747 |
12 | ab37a0540705 |
13 | 46c8726301a6 |
14 | 2016d0d22c61 |
15 | e1731dd34ce |
hex | 764eb2ac3f5 |
8130023572469 has 2 divisors, whose sum is σ = 8130023572470. Its totient is φ = 8130023572468.
The previous prime is 8130023572417. The next prime is 8130023572483. The reversal of 8130023572469 is 9642753200318.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4309933777444 + 3820089795025 = 2076038^2 + 1954505^2 .
It is a cyclic number.
It is not a de Polignac number, because 8130023572469 - 28 = 8130023572213 is a prime.
It is a super-2 number, since 2×81300235724692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8130023572369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4065011786234 + 4065011786235.
It is an arithmetic number, because the mean of its divisors is an integer number (4065011786235).
It is a 1-persistent number, because it is pandigital, but 2⋅8130023572469 = 16260047144938 is not.
Almost surely, 28130023572469 is an apocalyptic number.
It is an amenable number.
8130023572469 is a deficient number, since it is larger than the sum of its proper divisors (1).
8130023572469 is an equidigital number, since it uses as much as digits as its factorization.
8130023572469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 8130023572469 in words is "eight trillion, one hundred thirty billion, twenty-three million, five hundred seventy-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •