Base | Representation |
---|---|
bin | 1001010100110100… |
… | …01011000111100100 |
3 | 110220220120010000000 |
4 | 10222122023013210 |
5 | 40223124043102 |
6 | 2144442021300 |
7 | 235031210160 |
oct | 45232130744 |
9 | 13826503000 |
10 | 5006471652 |
11 | 213a028286 |
12 | b787a7830 |
13 | 61a2b6480 |
14 | 356ca7ca0 |
15 | 1e47d401c |
hex | 12a68b1e4 |
5006471652 has 384 divisors, whose sum is σ = 17074892800. Its totient is φ = 1247114880.
The previous prime is 5006471641. The next prime is 5006471677. The reversal of 5006471652 is 2561746005.
It is a happy number.
5006471652 is a `hidden beast` number, since 5 + 0 + 0 + 647 + 1 + 6 + 5 + 2 = 666.
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 127 ways as a sum of consecutive naturals, for example, 15125127 + ... + 15125457.
Almost surely, 25006471652 is an apocalyptic number.
5006471652 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5006471652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8537446400).
5006471652 is an abundant number, since it is smaller than the sum of its proper divisors (12068421148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5006471652 is a wasteful number, since it uses less digits than its factorization.
5006471652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395 (or 375 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 5006471652 is about 70756.4248107548. The cubic root of 5006471652 is about 1710.7133865549.
The spelling of 5006471652 in words is "five billion, six million, four hundred seventy-one thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •