Base | Representation |
---|---|
bin | 11000011011000100010110… |
… | …00000110110011101111110 |
3 | 21001011022010112020121201222 |
4 | 30031202023000312131332 |
5 | 24014412110422402220 |
6 | 310120250054233342 |
7 | 14212113461016065 |
oct | 1415421300663576 |
9 | 231138115217658 |
10 | 53706603325310 |
11 | 1612692a4a3501 |
12 | 6034848955852 |
13 | 23c7684779ba0 |
14 | d395b07c51dc |
15 | 63207301be25 |
hex | 30d88b03677e |
53706603325310 has 96 divisors (see below), whose sum is σ = 107587050391296. Its totient is φ = 19188271872000.
The previous prime is 53706603325213. The next prime is 53706603325327. The reversal of 53706603325310 is 1352330660735.
53706603325310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×537066033253102 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 1443047822 + ... + 1443085038.
It is an arithmetic number, because the mean of its divisors is an integer number (1120698441576).
Almost surely, 253706603325310 is an apocalyptic number.
53706603325310 is an abundant number, since it is smaller than the sum of its proper divisors (53880447065986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53706603325310 is a wasteful number, since it uses less digits than its factorization.
53706603325310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48850 (or 48819 counting only the distinct ones).
The product of its (nonzero) digits is 1020600, while the sum is 44.
The spelling of 53706603325310 in words is "fifty-three trillion, seven hundred six billion, six hundred three million, three hundred twenty-five thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •