Base | Representation |
---|---|
bin | 110001110000011000… |
… | …011101010011100000 |
3 | 12002220021200121120210 |
4 | 301300120131103200 |
5 | 1333403304122412 |
6 | 40313152334120 |
7 | 3600631402335 |
oct | 616030352340 |
9 | 162807617523 |
10 | 53425067232 |
11 | 2072606a829 |
12 | a42bb44340 |
13 | 5065531524 |
14 | 282b58498c |
15 | 15ca3ee83c |
hex | c7061d4e0 |
53425067232 has 96 divisors (see below), whose sum is σ = 147381075072. Its totient is φ = 16924045824.
The previous prime is 53425067149. The next prime is 53425067279. The reversal of 53425067232 is 23276052435.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-5 number, since 5×534250672325 (a number of 55 digits) contains 55555 as substring. Note that it is a super-d number also for d = 3.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22158 + ... + 327629.
It is an arithmetic number, because the mean of its divisors is an integer number (1535219532).
Almost surely, 253425067232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53425067232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73690537536).
53425067232 is an abundant number, since it is smaller than the sum of its proper divisors (93956007840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53425067232 is a wasteful number, since it uses less digits than its factorization.
53425067232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349880 (or 349872 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 39.
The spelling of 53425067232 in words is "fifty-three billion, four hundred twenty-five million, sixty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •