Base | Representation |
---|---|
bin | 1010000101001110… |
… | …00100101110010000 |
3 | 111222012120211010011 |
4 | 11002213010232100 |
5 | 42041100202022 |
6 | 2253024444304 |
7 | 251061355240 |
oct | 50247045620 |
9 | 14865524104 |
10 | 5412506512 |
11 | 2328245286 |
12 | 1070779694 |
13 | 68345b89a |
14 | 394b9db20 |
15 | 21a28a977 |
hex | 1429c4b90 |
5412506512 has 80 divisors (see below), whose sum is σ = 12712436352. Its totient is φ = 2179307520.
The previous prime is 5412506467. The next prime is 5412506543. The reversal of 5412506512 is 2156052145.
It is a super-2 number, since 2×54125065122 = 58590453484884812288, which contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1222062 + ... + 1226482.
Almost surely, 25412506512 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 5412506512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6356218176).
5412506512 is an abundant number, since it is smaller than the sum of its proper divisors (7299929840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5412506512 is a wasteful number, since it uses less digits than its factorization.
5412506512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5096 (or 5090 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The square root of 5412506512 is about 73569.7391051511. The cubic root of 5412506512 is about 1755.7640157972.
Adding to 5412506512 its reverse (2156052145), we get a palindrome (7568558657).
The spelling of 5412506512 in words is "five billion, four hundred twelve million, five hundred six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •