Base | Representation |
---|---|
bin | 10111101001011100100010… |
… | …01010111000110111001001 |
3 | 20211010022020020100102002011 |
4 | 23310232101022320313021 |
5 | 23303443241234301322 |
6 | 302333112442335521 |
7 | 13644664145011054 |
oct | 1364562112706711 |
9 | 224108206312064 |
10 | 52001604603337 |
11 | 15629836135134 |
12 | 59ba3141ba5a1 |
13 | 230296554247c |
14 | cbac69229a9b |
15 | 602a3394a677 |
hex | 2f4b912b8dc9 |
52001604603337 has 2 divisors, whose sum is σ = 52001604603338. Its totient is φ = 52001604603336.
The previous prime is 52001604603323. The next prime is 52001604603341. The reversal of 52001604603337 is 73330640610025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47974615229641 + 4026989373696 = 6926371^2 + 2006736^2 .
It is a cyclic number.
It is not a de Polignac number, because 52001604603337 - 219 = 52001604079049 is a prime.
It is a super-2 number, since 2×520016046033372 (a number of 28 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 52001604603337.
It is not a weakly prime, because it can be changed into another prime (52001604603737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26000802301668 + 26000802301669.
It is an arithmetic number, because the mean of its divisors is an integer number (26000802301669).
Almost surely, 252001604603337 is an apocalyptic number.
It is an amenable number.
52001604603337 is a deficient number, since it is larger than the sum of its proper divisors (1).
52001604603337 is an equidigital number, since it uses as much as digits as its factorization.
52001604603337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 52001604603337 in words is "fifty-two trillion, one billion, six hundred four million, six hundred three thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •