Base | Representation |
---|---|
bin | 1001101101001111… |
… | …00000011100100000 |
3 | 111110011222010201100 |
4 | 10312213200130200 |
5 | 41133042342342 |
6 | 2221040034400 |
7 | 243066156300 |
oct | 46647403440 |
9 | 14404863640 |
10 | 5211293472 |
11 | 2234703a10 |
12 | 1015302a00 |
13 | 65086b408 |
14 | 376183600 |
15 | 207791e4c |
hex | 1369e0720 |
5211293472 has 432 divisors, whose sum is σ = 19158703200. Its totient is φ = 1328302080.
The previous prime is 5211293449. The next prime is 5211293491. The reversal of 5211293472 is 2743921125.
5211293472 is a `hidden beast` number, since 521 + 1 + 2 + 93 + 47 + 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 71 ways as a sum of consecutive naturals, for example, 9158404 + ... + 9158972.
It is an arithmetic number, because the mean of its divisors is an integer number (44348850).
Almost surely, 25211293472 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 5211293472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9579351600).
5211293472 is an abundant number, since it is smaller than the sum of its proper divisors (13947409728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5211293472 is a wasteful number, since it uses less digits than its factorization.
5211293472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 669 (or 651 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 5211293472 is about 72189.2891778275. The cubic root of 5211293472 is about 1733.7315149658.
The spelling of 5211293472 in words is "five billion, two hundred eleven million, two hundred ninety-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •