Base | Representation |
---|---|
bin | 1001101101001010… |
… | …10011100110111010 |
3 | 111110010212211101210 |
4 | 10312211103212322 |
5 | 41132420412402 |
6 | 2221015423550 |
7 | 243061234410 |
oct | 46645234672 |
9 | 14403784353 |
10 | 5210716602 |
11 | 223434a563 |
12 | 1015084bb6 |
13 | 6506c8980 |
14 | 3760732b0 |
15 | 2076cb06c |
hex | 1369539ba |
5210716602 has 128 divisors (see below), whose sum is σ = 13121740800. Its totient is φ = 1342987776.
The previous prime is 5210716583. The next prime is 5210716603. The reversal of 5210716602 is 2066170125.
It is a self number, because there is not a number n which added to its sum of digits gives 5210716602.
It is not an unprimeable number, because it can be changed into a prime (5210716603) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4614774 + ... + 4615902.
It is an arithmetic number, because the mean of its divisors is an integer number (102513600).
Almost surely, 25210716602 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5210716602, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6560870400).
5210716602 is an abundant number, since it is smaller than the sum of its proper divisors (7911024198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5210716602 is a wasteful number, since it uses less digits than its factorization.
5210716602 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1340.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 5210716602 is about 72185.2935299151. The cubic root of 5210716602 is about 1733.6675401509.
Adding to 5210716602 its reverse (2066170125), we get a palindrome (7276886727).
The spelling of 5210716602 in words is "five billion, two hundred ten million, seven hundred sixteen thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •