Base | Representation |
---|---|
bin | 1001001010101100… |
… | …01110110100011000 |
3 | 110200222202202100100 |
4 | 10211112032310120 |
5 | 40034404132102 |
6 | 2132205535400 |
7 | 232650334356 |
oct | 44526166430 |
9 | 13628682310 |
10 | 4921552152 |
11 | 20a60a6a80 |
12 | b54274560 |
13 | 605822b4a |
14 | 3498c07d6 |
15 | 1dc10ca1c |
hex | 12558ed18 |
4921552152 has 96 divisors (see below), whose sum is σ = 14558778000. Its totient is φ = 1489551360.
The previous prime is 4921552123. The next prime is 4921552193. The reversal of 4921552152 is 2512551294.
4921552152 is a `hidden beast` number, since 4 + 92 + 1 + 552 + 15 + 2 = 666.
It is a super-2 number, since 2×49215521522 = 48443351169711662208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 732424 + ... + 739112.
Almost surely, 24921552152 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 4921552152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7279389000).
4921552152 is an abundant number, since it is smaller than the sum of its proper divisors (9637225848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4921552152 is a wasteful number, since it uses less digits than its factorization.
4921552152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7641 (or 7634 counting only the distinct ones).
The product of its digits is 36000, while the sum is 36.
The square root of 4921552152 is about 70153.7750374133. The cubic root of 4921552152 is about 1700.9858355820.
The spelling of 4921552152 in words is "four billion, nine hundred twenty-one million, five hundred fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •