Base | Representation |
---|---|
bin | 110000011111100101… |
… | …011001011001011000 |
3 | 11222101210221220020101 |
4 | 300133211121121120 |
5 | 1323114243121400 |
6 | 35530450105144 |
7 | 3522221325601 |
oct | 603745313130 |
9 | 158353856211 |
10 | 52069504600 |
11 | 2009a972533 |
12 | a111b7b1b4 |
13 | 4baa741269 |
14 | 273d51cda8 |
15 | 154b3d656a |
hex | c1f959658 |
52069504600 has 48 divisors (see below), whose sum is σ = 123637399200. Its totient is φ = 20384653440.
The previous prime is 52069504589. The next prime is 52069504621. The reversal of 52069504600 is 640596025.
52069504600 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×520695046002 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52069504600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2760255 + ... + 2779054.
It is an arithmetic number, because the mean of its divisors is an integer number (2575779150).
Almost surely, 252069504600 is an apocalyptic number.
52069504600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52069504600 is an abundant number, since it is smaller than the sum of its proper divisors (71567894600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52069504600 is a wasteful number, since it uses less digits than its factorization.
52069504600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5539372 (or 5539363 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 52069504600 in words is "fifty-two billion, sixty-nine million, five hundred four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •