Base | Representation |
---|---|
bin | 10101000101111011… |
… | …01000111100111110 |
3 | 1002020012002220120120 |
4 | 22202331220330332 |
5 | 141142421031420 |
6 | 5111400355410 |
7 | 550422300261 |
oct | 124275507476 |
9 | 32205086516 |
10 | 11324002110 |
11 | 4891116433 |
12 | 2240475b66 |
13 | 10b60aa385 |
14 | 795d30cd8 |
15 | 46423ed40 |
hex | 2a2f68f3e |
11324002110 has 16 divisors (see below), whose sum is σ = 27177605136. Its totient is φ = 3019733888.
The previous prime is 11324002097. The next prime is 11324002153. The reversal of 11324002110 is 1120042311.
It is a super-5 number, since 5×113240021105 (a number of 51 digits) contains 55555 as substring. Note that it is a super-d number also for d = 3.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11324002110.
It is a congruent number.
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, 188733339 + ... + 188733398.
It is an arithmetic number, because the mean of its divisors is an integer number (1698600321).
Almost surely, 211324002110 is an apocalyptic number.
11324002110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11324002110 is an abundant number, since it is smaller than the sum of its proper divisors (15853603026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11324002110 is a wasteful number, since it uses less digits than its factorization.
11324002110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377466747.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11324002110 its reverse (1120042311), we get a palindrome (12444044421).
The spelling of 11324002110 in words is "eleven billion, three hundred twenty-four million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •