Base | Representation |
---|---|
bin | 10100100101111111… |
… | …01101101110100100 |
3 | 1001112112000121101002 |
4 | 22102333231232210 |
5 | 140120331014000 |
6 | 5025030452432 |
7 | 540660250211 |
oct | 122277555644 |
9 | 31475017332 |
10 | 11056110500 |
11 | 4763982506 |
12 | 2186804118 |
13 | 1072742126 |
14 | 76c518b08 |
15 | 44a9748d5 |
hex | 292fedba4 |
11056110500 has 24 divisors (see below), whose sum is σ = 24146546424. Its totient is φ = 4422444000.
The previous prime is 11056110487. The next prime is 11056110521. The reversal of 11056110500 is 501165011.
It can be written as a sum of positive squares in 4 ways, for example, as 1507302976 + 9548807524 = 38824^2 + 97718^2 .
It is a hoax number, since the sum of its digits (20) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11055611 + ... + 11056610.
It is an arithmetic number, because the mean of its divisors is an integer number (1006106101).
Almost surely, 211056110500 is an apocalyptic number.
11056110500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11056110500 is an abundant number, since it is smaller than the sum of its proper divisors (13090435924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11056110500 is a wasteful number, since it uses less digits than its factorization.
11056110500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22112240 (or 22112228 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 11056110500 its reverse (501165011), we get a palindrome (11557275511).
The spelling of 11056110500 in words is "eleven billion, fifty-six million, one hundred ten thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •