Base | Representation |
---|---|
bin | 10111101001111101011101… |
… | …01000011101111110001011 |
3 | 20211011222211222101220020221 |
4 | 23310332232220131332023 |
5 | 23304240440331002323 |
6 | 302345154325130511 |
7 | 13646161135633015 |
oct | 1364765650357613 |
9 | 224158758356227 |
10 | 52019278765963 |
11 | 156362857a6103 |
12 | 5a01827259a37 |
13 | 23045210c9872 |
14 | cbba646791b5 |
15 | 60321a3de55d |
hex | 2f4faea1df8b |
52019278765963 has 2 divisors, whose sum is σ = 52019278765964. Its totient is φ = 52019278765962.
The previous prime is 52019278765901. The next prime is 52019278765999. The reversal of 52019278765963 is 36956787291025.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52019278765963 - 217 = 52019278634891 is a prime.
It is a super-2 number, since 2×520192787659632 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52019278765892 and 52019278765901.
It is not a weakly prime, because it can be changed into another prime (52019278765063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26009639382981 + 26009639382982.
It is an arithmetic number, because the mean of its divisors is an integer number (26009639382982).
Almost surely, 252019278765963 is an apocalyptic number.
52019278765963 is a deficient number, since it is larger than the sum of its proper divisors (1).
52019278765963 is an equidigital number, since it uses as much as digits as its factorization.
52019278765963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 342921600, while the sum is 70.
The spelling of 52019278765963 in words is "fifty-two trillion, nineteen billion, two hundred seventy-eight million, seven hundred sixty-five thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •