Base | Representation |
---|---|
bin | 1010011000100111… |
… | …11110000001010010 |
3 | 112101112212002022100 |
4 | 11030103332001102 |
5 | 42404232123412 |
6 | 2321121221230 |
7 | 255106005615 |
oct | 51423760122 |
9 | 15345762270 |
10 | 5575270482 |
11 | 2401105261 |
12 | 10b7191816 |
13 | 6ab0a9422 |
14 | 3ac64c17c |
15 | 2296dbedc |
hex | 14c4fe052 |
5575270482 has 48 divisors (see below), whose sum is σ = 12426036480. Its totient is φ = 1805309856.
The previous prime is 5575270457. The next prime is 5575270507. The reversal of 5575270482 is 2840725755.
5575270482 is a `hidden beast` number, since 5 + 57 + 52 + 70 + 482 = 666.
It is an interprime number because it is at equal distance from previous prime (5575270457) and next prime (5575270507).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 432543 + ... + 445245.
It is an arithmetic number, because the mean of its divisors is an integer number (258875760).
Almost surely, 25575270482 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5575270482, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6213018240).
5575270482 is an abundant number, since it is smaller than the sum of its proper divisors (6850765998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5575270482 is a wasteful number, since it uses less digits than its factorization.
5575270482 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13407 (or 13404 counting only the distinct ones).
The product of its (nonzero) digits is 784000, while the sum is 45.
The square root of 5575270482 is about 74667.7338748137. The cubic root of 5575270482 is about 1773.1901655371.
The spelling of 5575270482 in words is "five billion, five hundred seventy-five million, two hundred seventy thousand, four hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •