Base | Representation |
---|---|
bin | 1001101101001110… |
… | …01101010000000000 |
3 | 111110011211010212100 |
4 | 10312213031100000 |
5 | 41133032333343 |
6 | 2221034230400 |
7 | 243065411130 |
oct | 46647152000 |
9 | 14404733770 |
10 | 5211214848 |
11 | 223465a934 |
12 | 1015285400 |
13 | 6508416a8 |
14 | 376162ac0 |
15 | 2077789d3 |
hex | 1369cd400 |
5211214848 has 132 divisors (see below), whose sum is σ = 17197092640. Its totient is φ = 1488900096.
The previous prime is 5211214837. The next prime is 5211214861. The reversal of 5211214848 is 8484121125.
5211214848 is a `hidden beast` number, since 52 + 1 + 121 + 484 + 8 = 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 pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24123 + ... + 104901.
Almost surely, 25211214848 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 5211214848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8598546320).
5211214848 is an abundant number, since it is smaller than the sum of its proper divisors (11985877792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5211214848 is a wasteful number, since it uses less digits than its factorization.
5211214848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80812 (or 80791 counting only the distinct ones).
The product of its digits is 20480, while the sum is 36.
The square root of 5211214848 is about 72188.7446074525. The cubic root of 5211214848 is about 1733.7227958514.
The spelling of 5211214848 in words is "five billion, two hundred eleven million, two hundred fourteen thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •