Base | Representation |
---|---|
bin | 101001011001110010001… |
… | …0010010010110110000000 |
3 | 202010222211102212020010121 |
4 | 1102303210102102312000 |
5 | 1221212332333412203 |
6 | 20034041322510024 |
7 | 1125054406616500 |
oct | 122634422226600 |
9 | 22128742766117 |
10 | 5690366700928 |
11 | 18a42a8722a68 |
12 | 77a9b8365314 |
13 | 3237a37c6830 |
14 | 1595b5501a00 |
15 | 9d045c030bd |
hex | 52ce4492d80 |
5690366700928 has 192 divisors, whose sum is σ = 14222422383120. Its totient is φ = 2247816130560.
The previous prime is 5690366700911. The next prime is 5690366700943. The reversal of 5690366700928 is 8290076630965.
It is a super-2 number, since 2×56903667009282 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 55637998 + ... + 55740178.
Almost surely, 25690366700928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5690366700928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7111211191560).
5690366700928 is an abundant number, since it is smaller than the sum of its proper divisors (8532055682192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5690366700928 is a wasteful number, since it uses less digits than its factorization.
5690366700928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102905 (or 102886 counting only the distinct ones).
The product of its (nonzero) digits is 29393280, while the sum is 61.
The spelling of 5690366700928 in words is "five trillion, six hundred ninety billion, three hundred sixty-six million, seven hundred thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •