Base | Representation |
---|---|
bin | 1001100001001100… |
… | …10011000110001000 |
3 | 111012010221211000220 |
4 | 10300212103012020 |
5 | 40431220011402 |
6 | 2203031430040 |
7 | 240431642514 |
oct | 46046230610 |
9 | 14163854026 |
10 | 5110313352 |
11 | 2192703071 |
12 | ba7525320 |
13 | 635973771 |
14 | 3669b9144 |
15 | 1ed996dbc |
hex | 130993188 |
5110313352 has 16 divisors (see below), whose sum is σ = 12775783440. Its totient is φ = 1703437776.
The previous prime is 5110313333. The next prime is 5110313363. The reversal of 5110313352 is 2533130115.
It is a super-2 number, since 2×51103133522 = 52230605111258951808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 212929723 = 5110313352 / (5 + 1 + 1 + 0 + 3 + 1 + 3 + 3 + 5 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106464838 + ... + 106464885.
It is an arithmetic number, because the mean of its divisors is an integer number (798486465).
Almost surely, 25110313352 is an apocalyptic number.
It is an amenable number.
5110313352 is an abundant number, since it is smaller than the sum of its proper divisors (7665470088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110313352 is a wasteful number, since it uses less digits than its factorization.
5110313352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212929732 (or 212929728 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 24.
The square root of 5110313352 is about 71486.4557241440. The cubic root of 5110313352 is about 1722.4601257057.
Adding to 5110313352 its reverse (2533130115), we get a palindrome (7643443467).
The spelling of 5110313352 in words is "five billion, one hundred ten million, three hundred thirteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •