Base | Representation |
---|---|
bin | 110001110010100111… |
… | …010101000101000011 |
3 | 12002222220011102022012 |
4 | 301302213111011003 |
5 | 1333442401121011 |
6 | 40321011203135 |
7 | 3601564631426 |
oct | 616247250503 |
9 | 162886142265 |
10 | 53462520131 |
11 | 20745220739 |
12 | a4405a64ab |
13 | 50702158c7 |
14 | 28325339bd |
15 | 15cd84ba8b |
hex | c729d5143 |
53462520131 has 32 divisors (see below), whose sum is σ = 59827852800. Its totient is φ = 47538247680.
The previous prime is 53462520121. The next prime is 53462520151. The reversal of 53462520131 is 13102526435.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 53462520131 - 214 = 53462503747 is a prime.
It is a super-2 number, since 2×534625201312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53462520121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17040995 + ... + 17044131.
It is an arithmetic number, because the mean of its divisors is an integer number (1869620400).
Almost surely, 253462520131 is an apocalyptic number.
53462520131 is a deficient number, since it is larger than the sum of its proper divisors (6365332669).
53462520131 is a wasteful number, since it uses less digits than its factorization.
53462520131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3899.
The product of its (nonzero) digits is 21600, while the sum is 32.
The spelling of 53462520131 in words is "fifty-three billion, four hundred sixty-two million, five hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •