Base | Representation |
---|---|
bin | 10010110001000110… |
… | …01101101000110100 |
3 | 222000011221111122102 |
4 | 21120203031220310 |
5 | 131113320414000 |
6 | 4343442121232 |
7 | 504452564645 |
oct | 113043155064 |
9 | 28004844572 |
10 | 10075560500 |
11 | 4300433805 |
12 | 1b52350218 |
13 | c47554c25 |
14 | 6b81d16cc |
15 | 3de8363d5 |
hex | 2588cda34 |
10075560500 has 60 divisors (see below), whose sum is σ = 22338433572. Its totient is φ = 3970071600.
The previous prime is 10075560497. The next prime is 10075560529. The reversal of 10075560500 is 506557001.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 322417936 + 9753142564 = 17956^2 + 98758^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 150381467 + ... + 150381533.
Almost surely, 210075560500 is an apocalyptic number.
10075560500 is a gapful number since it is divisible by the number (10) 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 10075560500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11169216786).
10075560500 is an abundant number, since it is smaller than the sum of its proper divisors (12262873072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10075560500 is an frugal number, since it uses more digits than its factorization.
10075560500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287 (or 74 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 29.
The spelling of 10075560500 in words is "ten billion, seventy-five million, five hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •