Base | Representation |
---|---|
bin | 1010101000011101… |
… | …10011010010000000 |
3 | 112201210212020010000 |
4 | 11110032303102000 |
5 | 43142240233004 |
6 | 2342225040000 |
7 | 261311222433 |
oct | 52416632200 |
9 | 15653766100 |
10 | 5708133504 |
11 | 246a102207 |
12 | 1133786000 |
13 | 6cc7880b8 |
14 | 3c215581a |
15 | 2361d3c39 |
hex | 1543b3480 |
5708133504 has 80 divisors (see below), whose sum is σ = 16987343670. Its totient is φ = 1902707712.
The previous prime is 5708133493. The next prime is 5708133521. The reversal of 5708133504 is 4053318075.
5708133504 is a `hidden beast` number, since 5 + 70 + 81 + 3 + 3 + 504 = 666.
It can be written as a sum of positive squares in only one way, i.e., 5091107904 + 617025600 = 71352^2 + 24840^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
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 9 ways as a sum of consecutive naturals, for example, 264909 + ... + 285644.
Almost surely, 25708133504 is an apocalyptic number.
5708133504 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
5708133504 is an abundant number, since it is smaller than the sum of its proper divisors (11279210166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5708133504 is an equidigital number, since it uses as much as digits as its factorization.
5708133504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550579 (or 550558 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 5708133504 is about 75552.1905969642. The cubic root of 5708133504 is about 1787.1652335020.
The spelling of 5708133504 in words is "five billion, seven hundred eight million, one hundred thirty-three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •