Base | Representation |
---|---|
bin | 1001100001100100… |
… | …11001111110000000 |
3 | 111012100221001210000 |
4 | 10300302121332000 |
5 | 40433023042412 |
6 | 2203223440000 |
7 | 240500632020 |
oct | 46062317600 |
9 | 14170831700 |
10 | 5113487232 |
11 | 2194480707 |
12 | ba85b6000 |
13 | 6365152b9 |
14 | 3671a3a80 |
15 | 1eddc24dc |
hex | 130c99f80 |
5113487232 has 160 divisors (see below), whose sum is σ = 17391852720. Its totient is φ = 1460975616.
The previous prime is 5113487219. The next prime is 5113487279. The reversal of 5113487232 is 2327843115.
5113487232 is a `hidden beast` number, since 511 + 3 + 48 + 72 + 32 = 666.
It is a super-2 number, since 2×51134872322 = 52295503343654043648, which contains 22 as substring.
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 19 ways as a sum of consecutive naturals, for example, 37348 + ... + 107804.
Almost surely, 25113487232 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 5113487232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8695926360).
5113487232 is an abundant number, since it is smaller than the sum of its proper divisors (12278365488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5113487232 is an equidigital number, since it uses as much as digits as its factorization.
5113487232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70490 (or 70469 counting only the distinct ones).
The product of its digits is 40320, while the sum is 36.
The square root of 5113487232 is about 71508.6514486184. The cubic root of 5113487232 is about 1722.8166433319.
The spelling of 5113487232 in words is "five billion, one hundred thirteen million, four hundred eighty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •