Base | Representation |
---|---|
bin | 1010011110111011… |
… | …11101000100000000 |
3 | 112112020111011220120 |
4 | 11033131331010000 |
5 | 43011311012043 |
6 | 2330252140240 |
7 | 256321035432 |
oct | 51735750400 |
9 | 15466434816 |
10 | 5628219648 |
11 | 2428a8a7a7 |
12 | 1110a67680 |
13 | 6b9057cac |
14 | 3b56b2652 |
15 | 22e19a983 |
hex | 14f77d100 |
5628219648 has 72 divisors (see below), whose sum is σ = 15860442528. Its totient is φ = 1765711872.
The previous prime is 5628219643. The next prime is 5628219683. The reversal of 5628219648 is 8469128265.
It is a happy number.
It is a super-2 number, since 2×56282196482 = 63353712812266487808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 5628219648.
It is not an unprimeable number, because it can be changed into a prime (5628219643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202486 + ... + 228597.
It is an arithmetic number, because the mean of its divisors is an integer number (220283924).
Almost surely, 25628219648 is an apocalyptic number.
It is an amenable number.
5628219648 is an abundant number, since it is smaller than the sum of its proper divisors (10232222880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5628219648 is a wasteful number, since it uses less digits than its factorization.
5628219648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431119 (or 431105 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 51.
The square root of 5628219648 is about 75021.4612494318. The cubic root of 5628219648 is about 1778.7859043975.
The spelling of 5628219648 in words is "five billion, six hundred twenty-eight million, two hundred nineteen thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •