Base | Representation |
---|---|
bin | 1001100000100111… |
… | …10111001100011000 |
3 | 111011210212021120100 |
4 | 10300103313030120 |
5 | 40424000333342 |
6 | 2202340055400 |
7 | 240342603501 |
oct | 46023671430 |
9 | 14153767510 |
10 | 5105480472 |
11 | 218aa02054 |
12 | ba5994560 |
13 | 634970a81 |
14 | 3660bbba8 |
15 | 1ed33ee4c |
hex | 1304f7318 |
5105480472 has 96 divisors (see below), whose sum is σ = 14186137680. Its totient is φ = 1657877760.
The previous prime is 5105480447. The next prime is 5105480473. The reversal of 5105480472 is 2740845015.
5105480472 is a `hidden beast` number, since 5 + 105 + 4 + 80 + 472 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105480473) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1301458 + ... + 1305374.
Almost surely, 25105480472 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 5105480472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7093068840).
5105480472 is an abundant number, since it is smaller than the sum of its proper divisors (9080657208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105480472 is a wasteful number, since it uses less digits than its factorization.
5105480472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4393 (or 4386 counting only the distinct ones).
The product of its (nonzero) digits is 44800, while the sum is 36.
The square root of 5105480472 is about 71452.6449615408. The cubic root of 5105480472 is about 1721.9169712342.
The spelling of 5105480472 in words is "five billion, one hundred five million, four hundred eighty thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •