Base | Representation |
---|---|
bin | 1010010000011100… |
… | …01001111101000000 |
3 | 112012202201011201221 |
4 | 11020032021331000 |
5 | 42234144401012 |
6 | 2310230204424 |
7 | 253313435056 |
oct | 51016117500 |
9 | 15182634657 |
10 | 5506637632 |
11 | 23763983a1 |
12 | 10981b3714 |
13 | 699ac8c82 |
14 | 3a34a41d6 |
15 | 223681507 |
hex | 148389f40 |
5506637632 has 42 divisors (see below), whose sum is σ = 11291222274. Its totient is φ = 2664472320.
The previous prime is 5506637629. The next prime is 5506637651. The reversal of 5506637632 is 2367366055.
It can be written as a sum of positive squares in only one way, i.e., 5461801216 + 44836416 = 73904^2 + 6696^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16738 + ... + 106270.
Almost surely, 25506637632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5506637632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5645611137).
5506637632 is an abundant number, since it is smaller than the sum of its proper divisors (5784584642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5506637632 is an equidigital number, since it uses as much as digits as its factorization.
5506637632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89607 (or 89566 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 43.
The square root of 5506637632 is about 74206.7222830924. The cubic root of 5506637632 is about 1765.8839777446.
The spelling of 5506637632 in words is "five billion, five hundred six million, six hundred thirty-seven thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •