Base | Representation |
---|---|
bin | 11000000111001001001010… |
… | …10101010010101000010000 |
3 | 20221201212001011210210002110 |
4 | 30003210211111102220100 |
5 | 23422203022341414230 |
6 | 304433545221545320 |
7 | 14111466346310421 |
oct | 1403444525225020 |
9 | 227655034723073 |
10 | 53021997607440 |
11 | 15992559406924 |
12 | 5b44027875240 |
13 | 2377c50747b34 |
14 | d143c7c1b648 |
15 | 61e3556ad4b0 |
hex | 303925552a10 |
53021997607440 has 320 divisors, whose sum is σ = 170993987684352. Its totient is φ = 13581540864000.
The previous prime is 53021997607421. The next prime is 53021997607451. The reversal of 53021997607440 is 4470679912035.
It is a happy number.
It is a super-2 number, since 2×530219976074402 (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 (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 171464965 + ... + 171773915.
Almost surely, 253021997607440 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 53021997607440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85496993842176).
53021997607440 is an abundant number, since it is smaller than the sum of its proper divisors (117971990076912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53021997607440 is a wasteful number, since it uses less digits than its factorization.
53021997607440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309278 (or 309272 counting only the distinct ones).
The product of its (nonzero) digits is 11430720, while the sum is 57.
The spelling of 53021997607440 in words is "fifty-three trillion, twenty-one billion, nine hundred ninety-seven million, six hundred seven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •