Base | Representation |
---|---|
bin | 1010010101101110… |
… | …11010001110101000 |
3 | 112022212012100120020 |
4 | 11022313122032220 |
5 | 42332024203012 |
6 | 2314453200440 |
7 | 254362530543 |
oct | 51267321650 |
9 | 15285170506 |
10 | 5551006632 |
11 | 2399442496 |
12 | 10ab030120 |
13 | 6a6062312 |
14 | 3a933385a |
15 | 2274e7a8c |
hex | 14adda3a8 |
5551006632 has 64 divisors (see below), whose sum is σ = 14124274560. Its totient is φ = 1817625600.
The previous prime is 5551006631. The next prime is 5551006633. The reversal of 5551006632 is 2366001555.
It is an interprime number because it is at equal distance from previous prime (5551006631) and next prime (5551006633).
It is a junction number, because it is equal to n+sod(n) for n = 5551006593 and 5551006602.
It is not an unprimeable number, because it can be changed into a prime (5551006631) 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 15 ways as a sum of consecutive naturals, for example, 473028 + ... + 484620.
It is an arithmetic number, because the mean of its divisors is an integer number (220691790).
Almost surely, 25551006632 is an apocalyptic number.
It is an amenable number.
5551006632 is an abundant number, since it is smaller than the sum of its proper divisors (8573267928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5551006632 is a wasteful number, since it uses less digits than its factorization.
5551006632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11954 (or 11950 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
The square root of 5551006632 is about 74505.0778940603. The cubic root of 5551006632 is about 1770.6140880489.
The spelling of 5551006632 in words is "five billion, five hundred fifty-one million, six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •