Base | Representation |
---|---|
bin | 1001110100010011… |
… | …10000011011101100 |
3 | 111121022120101210001 |
4 | 10322021300123230 |
5 | 41243233303000 |
6 | 2230555154044 |
7 | 244416250651 |
oct | 47211603354 |
9 | 14538511701 |
10 | 5270603500 |
11 | 2265133468 |
12 | 1031145924 |
13 | 65cc362c6 |
14 | 37ddc1c28 |
15 | 20caaa46a |
hex | 13a2706ec |
5270603500 has 192 divisors, whose sum is σ = 12680478720. Its totient is φ = 1905945600.
The previous prime is 5270603489. The next prime is 5270603519. The reversal of 5270603500 is 53060725.
It is a super-2 number, since 2×52706035002 = 55558522508424500000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31560417 + ... + 31560583.
It is an arithmetic number, because the mean of its divisors is an integer number (66044160).
Almost surely, 25270603500 is an apocalyptic number.
5270603500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5270603500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6340239360).
5270603500 is an abundant number, since it is smaller than the sum of its proper divisors (7409875220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5270603500 is a wasteful number, since it uses less digits than its factorization.
5270603500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329 (or 317 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 5270603500 is about 72598.9221683077. The cubic root of 5270603500 is about 1740.2839519856.
The spelling of 5270603500 in words is "five billion, two hundred seventy million, six hundred three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •