Base | Representation |
---|---|
bin | 1010110010000000… |
… | …00110100100000110 |
3 | 112221101110022121120 |
4 | 11121000012210012 |
5 | 43323232311111 |
6 | 2354204254410 |
7 | 263302413501 |
oct | 53100064406 |
9 | 15841408546 |
10 | 5788166406 |
11 | 25002a6100 |
12 | 1156541406 |
13 | 71322a449 |
14 | 3cca2a138 |
15 | 23d242406 |
hex | 159006906 |
5788166406 has 48 divisors (see below), whose sum is σ = 12735109632. Its totient is φ = 1752513840.
The previous prime is 5788166389. The next prime is 5788166413. The reversal of 5788166406 is 6046618875.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1117635 + ... + 1122801.
It is an arithmetic number, because the mean of its divisors is an integer number (265314784).
Almost surely, 25788166406 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5788166406, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6367554816).
5788166406 is an abundant number, since it is smaller than the sum of its proper divisors (6946943226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5788166406 is a wasteful number, since it uses less digits than its factorization.
5788166406 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6737 (or 6726 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 51.
The square root of 5788166406 is about 76080.0000394322. Note that the first 4 decimals coincide. The cubic root of 5788166406 is about 1795.4790253768.
The spelling of 5788166406 in words is "five billion, seven hundred eighty-eight million, one hundred sixty-six thousand, four hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •