Base | Representation |
---|---|
bin | 1010100001000000… |
… | …10001000100111100 |
3 | 112120110012100120022 |
4 | 11100200101010330 |
5 | 43030233300012 |
6 | 2332112511312 |
7 | 256621556231 |
oct | 52040210474 |
9 | 15513170508 |
10 | 5645603132 |
11 | 2437883214 |
12 | 111684b538 |
13 | 6bc833490 |
14 | 3b7b19788 |
15 | 230981472 |
hex | 15081113c |
5645603132 has 24 divisors (see below), whose sum is σ = 10641878016. Its totient is φ = 2605151808.
The previous prime is 5645603053. The next prime is 5645603137. The reversal of 5645603132 is 2313065465.
It is a junction number, because it is equal to n+sod(n) for n = 5645603092 and 5645603101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5645603137) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 432818 + ... + 445670.
It is an arithmetic number, because the mean of its divisors is an integer number (443411584).
Almost surely, 25645603132 is an apocalyptic number.
5645603132 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5645603132 is a deficient number, since it is larger than the sum of its proper divisors (4996274884).
5645603132 is a wasteful number, since it uses less digits than its factorization.
5645603132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21317 (or 21315 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
The square root of 5645603132 is about 75137.2286686167. The cubic root of 5645603132 is about 1780.6153589285.
Adding to 5645603132 its reverse (2313065465), we get a palindrome (7958668597).
The spelling of 5645603132 in words is "five billion, six hundred forty-five million, six hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •