Base | Representation |
---|---|
bin | 101001111011100001100… |
… | …1111101110010110011100 |
3 | 202101220212022100211011000 |
4 | 1103313003033232112130 |
5 | 1223404232131314233 |
6 | 20131223414430300 |
7 | 1133231135526060 |
oct | 123670317562634 |
9 | 22356768324130 |
10 | 5762826823068 |
11 | 1922001561227 |
12 | 790a5b062390 |
13 | 32a58081a553 |
14 | 15cccab47aa0 |
15 | 9ed872b3d13 |
hex | 53dc33ee59c |
5762826823068 has 96 divisors (see below), whose sum is σ = 17077482616320. Its totient is φ = 1646286647040.
The previous prime is 5762826823001. The next prime is 5762826823069. The reversal of 5762826823068 is 8603286282675.
5762826823068 is a `hidden beast` number, since 5 + 7 + 6 + 282 + 68 + 230 + 68 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 5762826822996 and 5762826823014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5762826823069) 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, 4783348 + ... + 5865668.
It is an arithmetic number, because the mean of its divisors is an integer number (177890443920).
Almost surely, 25762826823068 is an apocalyptic number.
It is an amenable number.
5762826823068 is an abundant number, since it is smaller than the sum of its proper divisors (11314655793252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5762826823068 is a wasteful number, since it uses less digits than its factorization.
5762826823068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1089384 (or 1089376 counting only the distinct ones).
The product of its (nonzero) digits is 92897280, while the sum is 63.
The spelling of 5762826823068 in words is "five trillion, seven hundred sixty-two billion, eight hundred twenty-six million, eight hundred twenty-three thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •