Base | Representation |
---|---|
bin | 110000100001111100… |
… | …000000110000000000 |
3 | 11222111120020211110000 |
4 | 300201330000300000 |
5 | 1323204400044032 |
6 | 35534420240000 |
7 | 3523211041020 |
oct | 604174006000 |
9 | 158446224400 |
10 | 52108987392 |
11 | 2011018a540 |
12 | a123240000 |
13 | 4bb5986567 |
14 | 2744879a80 |
15 | 154ead4e7c |
hex | c21f00c00 |
52108987392 has 880 divisors, whose sum is σ = 199734796800. Its totient is φ = 13138329600.
The previous prime is 52108987379. The next prime is 52108987409. The reversal of 52108987392 is 29378980125.
52108987392 is a `hidden beast` number, since 521 + 0 + 8 + 9 + 87 + 39 + 2 = 666.
It is a super-2 number, since 2×521089873922 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 261854109 + ... + 261854307.
It is an arithmetic number, because the mean of its divisors is an integer number (226971360).
Almost surely, 252108987392 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 52108987392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99867398400).
52108987392 is an abundant number, since it is smaller than the sum of its proper divisors (147625809408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52108987392 is a wasteful number, since it uses less digits than its factorization.
52108987392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 54.
The spelling of 52108987392 in words is "fifty-two billion, one hundred eight million, nine hundred eighty-seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •