Base | Representation |
---|---|
bin | 1010101000100011… |
… | …10100110001101110 |
3 | 112201212100111022000 |
4 | 11110101310301232 |
5 | 43142441113222 |
6 | 2342254033130 |
7 | 261321033210 |
oct | 52421646156 |
9 | 15655314260 |
10 | 5708926062 |
11 | 246a5a3714 |
12 | 1133aa87a6 |
13 | 6cc9a4a78 |
14 | 3c22c05b0 |
15 | 2362dd9ac |
hex | 154474c6e |
5708926062 has 64 divisors (see below), whose sum is σ = 14585840640. Its totient is φ = 1621336608.
The previous prime is 5708926061. The next prime is 5708926099. The reversal of 5708926062 is 2606298075.
It is a junction number, because it is equal to n+sod(n) for n = 5708925999 and 5708926017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5708926061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17908 + ... + 108344.
It is an arithmetic number, because the mean of its divisors is an integer number (227903760).
Almost surely, 25708926062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5708926062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7292920320).
5708926062 is an abundant number, since it is smaller than the sum of its proper divisors (8876914578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5708926062 is a wasteful number, since it uses less digits than its factorization.
5708926062 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90622 (or 90616 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 5708926062 is about 75557.4355176246. The cubic root of 5708926062 is about 1787.2479439333.
The spelling of 5708926062 in words is "five billion, seven hundred eight million, nine hundred twenty-six thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •