Base | Representation |
---|---|
bin | 11000100001101001000101… |
… | …10111111100001000101010 |
3 | 21001221220011220210102221000 |
4 | 30100310202313330020222 |
5 | 24032112214243103300 |
6 | 310412124341255430 |
7 | 14234331236131566 |
oct | 1420644267741052 |
9 | 231856156712830 |
10 | 53932489425450 |
11 | 16203705299899 |
12 | 6070589704576 |
13 | 2412a72a7027c |
14 | d464bc7cc6a6 |
15 | 637d93d46c00 |
hex | 310d22dfc22a |
53932489425450 has 96 divisors (see below), whose sum is σ = 148621371909120. Its totient is φ = 14381280950400.
The previous prime is 53932489425443. The next prime is 53932489425481. The reversal of 53932489425450 is 5452498423935.
53932489425450 is a `hidden beast` number, since 5 + 3 + 9 + 3 + 2 + 4 + 89 + 4 + 2 + 545 + 0 = 666.
It is a super-2 number, since 2×539324894254502 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26402830 + ... + 28372070.
It is an arithmetic number, because the mean of its divisors is an integer number (1548139290720).
Almost surely, 253932489425450 is an apocalyptic number.
53932489425450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53932489425450 is an abundant number, since it is smaller than the sum of its proper divisors (94688882483670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53932489425450 is a wasteful number, since it uses less digits than its factorization.
53932489425450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989549 (or 1989538 counting only the distinct ones).
The product of its (nonzero) digits is 186624000, while the sum is 63.
The spelling of 53932489425450 in words is "fifty-three trillion, nine hundred thirty-two billion, four hundred eighty-nine million, four hundred twenty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •