Base | Representation |
---|---|
bin | 1010100001110010… |
… | …00110101000000000 |
3 | 112120220110010200121 |
4 | 11100321012220000 |
5 | 43033420121140 |
6 | 2332504230024 |
7 | 260031114145 |
oct | 52071065000 |
9 | 15526403617 |
10 | 5652113920 |
11 | 244051a932 |
12 | 1118a6b314 |
13 | 6c0ca2b0b |
14 | 3b89323cc |
15 | 23131a64a |
hex | 150e46a00 |
5652113920 has 160 divisors (see below), whose sum is σ = 14760662400. Its totient is φ = 2067480576.
The previous prime is 5652113899. The next prime is 5652113933. The reversal of 5652113920 is 293112565.
It is a tau number, because it is divible by the number of its divisors (160).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1408557 + ... + 1412563.
It is an arithmetic number, because the mean of its divisors is an integer number (92254140).
Almost surely, 25652113920 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 5652113920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7380331200).
5652113920 is an abundant number, since it is smaller than the sum of its proper divisors (9108548480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5652113920 is a wasteful number, since it uses less digits than its factorization.
5652113920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4078 (or 4062 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 5652113920 is about 75180.5421635146. The cubic root of 5652113920 is about 1781.2995937849.
The spelling of 5652113920 in words is "five billion, six hundred fifty-two million, one hundred thirteen thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •