Base | Representation |
---|---|
bin | 10111110101101010100001… |
… | …10001111000010001011001 |
3 | 20212121102212122222012011220 |
4 | 23322311100301320101121 |
5 | 23332333042330204010 |
6 | 303254023433242253 |
7 | 14020215634240605 |
oct | 1372652061702131 |
9 | 225542778865156 |
10 | 52421431100505 |
11 | 15780893261285 |
12 | 5a6775b263389 |
13 | 233342061a92c |
14 | cd32d462c505 |
15 | 60d905c3b970 |
hex | 2fad50c78459 |
52421431100505 has 16 divisors (see below), whose sum is σ = 84884823374400. Its totient is φ = 27621252049088.
The previous prime is 52421431100491. The next prime is 52421431100527. The reversal of 52421431100505 is 50500113412425.
52421431100505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 52421431100505 - 211 = 52421431098457 is a prime.
It is a super-2 number, since 2×524214311005052 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 21052782330 + ... + 21052784819.
It is an arithmetic number, because the mean of its divisors is an integer number (5305301460900).
Almost surely, 252421431100505 is an apocalyptic number.
It is an amenable number.
52421431100505 is a deficient number, since it is larger than the sum of its proper divisors (32463392273895).
52421431100505 is a wasteful number, since it uses less digits than its factorization.
52421431100505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42105567240.
The product of its (nonzero) digits is 24000, while the sum is 33.
The spelling of 52421431100505 in words is "fifty-two trillion, four hundred twenty-one billion, four hundred thirty-one million, one hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •