Base | Representation |
---|---|
bin | 10111101111010000111001… |
… | …00101000110000000110111 |
3 | 20211211102020010101102212021 |
4 | 23313220130211012000313 |
5 | 23320232144033022331 |
6 | 303005013223534011 |
7 | 13665302062605121 |
oct | 1367503445060067 |
9 | 224742203342767 |
10 | 52201512001591 |
11 | 156a659a6a8267 |
12 | 5a310048ba307 |
13 | 231877360b3c4 |
14 | cc67d0cc4211 |
15 | 607d33bcc211 |
hex | 2f7a1c946037 |
52201512001591 has 2 divisors, whose sum is σ = 52201512001592. Its totient is φ = 52201512001590.
The previous prime is 52201512001559. The next prime is 52201512001621. The reversal of 52201512001591 is 19510021510225.
52201512001591 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52201512001591 - 25 = 52201512001559 is a prime.
It is a super-2 number, since 2×522015120015912 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52201512004591) 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, 26100756000795 + 26100756000796.
It is an arithmetic number, because the mean of its divisors is an integer number (26100756000796).
Almost surely, 252201512001591 is an apocalyptic number.
52201512001591 is a deficient number, since it is larger than the sum of its proper divisors (1).
52201512001591 is an equidigital number, since it uses as much as digits as its factorization.
52201512001591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 34.
The spelling of 52201512001591 in words is "fifty-two trillion, two hundred one billion, five hundred twelve million, one thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •