Base | Representation |
---|---|
bin | 10101100010011000… |
… | …01101000001100100 |
3 | 1002211211021001202111 |
4 | 22301030031001210 |
5 | 142140022412100 |
6 | 5151204450404 |
7 | 556351223152 |
oct | 126114150144 |
9 | 32754231674 |
10 | 11562700900 |
11 | 49a3930363 |
12 | 22a83a9a04 |
13 | 1123693b6a |
14 | 7b99083d2 |
15 | 47a1906ba |
hex | 2b130d064 |
11562700900 has 27 divisors (see below), whose sum is σ = 25093394571. Its totient is φ = 4624650240.
The previous prime is 11562700871. The next prime is 11562700901. The reversal of 11562700900 is 900726511.
The square root of 11562700900 is 107530.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1850204196 + 9712496704 = 43014^2 + 98552^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11562700901) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 1069924 + ... + 1080676.
Almost surely, 211562700900 is an apocalyptic number.
11562700900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11562700900 is the 107530-th square number.
It is an amenable number.
11562700900 is an abundant number, since it is smaller than the sum of its proper divisors (13530693671).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11562700900 is an frugal number, since it uses more digits than its factorization.
11562700900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21520 (or 10760 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 31.
The spelling of 11562700900 in words is "eleven billion, five hundred sixty-two million, seven hundred thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •