Base | Representation |
---|---|
bin | 1010011111001110… |
… | …01111100001001000 |
3 | 112112102001212221121 |
4 | 11033213033201020 |
5 | 43012421421121 |
6 | 2330420245024 |
7 | 256350526303 |
oct | 51747174110 |
9 | 15472055847 |
10 | 5630654536 |
11 | 242a3a3101 |
12 | 1111840774 |
13 | 6b96cb360 |
14 | 3b5b47b3a |
15 | 22e4cc141 |
hex | 14f9cf848 |
5630654536 has 32 divisors (see below), whose sum is σ = 11417212800. Its totient is φ = 2587878720.
The previous prime is 5630654521. The next prime is 5630654539. The reversal of 5630654536 is 6354560365.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 5630654492 and 5630654501.
It is not an unprimeable number, because it can be changed into a prime (5630654539) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 88410 + ... + 138121.
It is an arithmetic number, because the mean of its divisors is an integer number (356787900).
Almost surely, 25630654536 is an apocalyptic number.
It is an amenable number.
5630654536 is an abundant number, since it is smaller than the sum of its proper divisors (5786558264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5630654536 is a wasteful number, since it uses less digits than its factorization.
5630654536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226789 (or 226785 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 43.
The square root of 5630654536 is about 75037.6874377136. The cubic root of 5630654536 is about 1779.0423810036.
The spelling of 5630654536 in words is "five billion, six hundred thirty million, six hundred fifty-four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •