Base | Representation |
---|---|
bin | 1001101101001010… |
… | …11101111000001100 |
3 | 111110010221222002210 |
4 | 10312211131320030 |
5 | 41132423234133 |
6 | 2221020350420 |
7 | 243061501143 |
oct | 46645357014 |
9 | 14403858083 |
10 | 5210758668 |
11 | 2234379125 |
12 | 10150a5410 |
13 | 650711b6b |
14 | 37608475a |
15 | 2076d8763 |
hex | 13695de0c |
5210758668 has 48 divisors (see below), whose sum is σ = 12248853120. Its totient is φ = 1724050944.
The previous prime is 5210758667. The next prime is 5210758691. The reversal of 5210758668 is 8668570125.
It is a super-2 number, since 2×52107586682 = 54304011792274268448, which contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (5210758667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 958863 + ... + 964281.
It is an arithmetic number, because the mean of its divisors is an integer number (255184440).
Almost surely, 25210758668 is an apocalyptic number.
It is an amenable number.
5210758668 is an abundant number, since it is smaller than the sum of its proper divisors (7038094452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5210758668 is a wasteful number, since it uses less digits than its factorization.
5210758668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6006 (or 6004 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 48.
The square root of 5210758668 is about 72185.5849044669. The cubic root of 5210758668 is about 1733.6722054249.
The spelling of 5210758668 in words is "five billion, two hundred ten million, seven hundred fifty-eight thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •