Base | Representation |
---|---|
bin | 1001100001101110… |
… | …11001100100100100 |
3 | 111012110101120111220 |
4 | 10300313121210210 |
5 | 40433341440244 |
6 | 2203311500340 |
7 | 240515023431 |
oct | 46067314444 |
9 | 14173346456 |
10 | 5114796324 |
11 | 2195195200 |
12 | ba8b276b0 |
13 | 636883101 |
14 | 367424b88 |
15 | 1ee080319 |
hex | 130dd9924 |
5114796324 has 144 divisors (see below), whose sum is σ = 13952844864. Its totient is φ = 1452154880.
The previous prime is 5114796311. The next prime is 5114796329. The reversal of 5114796324 is 4236974115.
It is a super-2 number, since 2×51147963242 = 52322282872007825952, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5114796329) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8713159 + ... + 8713745.
It is an arithmetic number, because the mean of its divisors is an integer number (96894756).
Almost surely, 25114796324 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 5114796324, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6976422432).
5114796324 is an abundant number, since it is smaller than the sum of its proper divisors (8838048540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5114796324 is a wasteful number, since it uses less digits than its factorization.
5114796324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986 (or 973 counting only the distinct ones).
The product of its digits is 181440, while the sum is 42.
The square root of 5114796324 is about 71517.8042448172. The cubic root of 5114796324 is about 1722.9636488847.
The spelling of 5114796324 in words is "five billion, one hundred fourteen million, seven hundred ninety-six thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •