Base | Representation |
---|---|
bin | 10100100010011010… |
… | …10001101011100000 |
3 | 1001110102120111001220 |
4 | 22101031101223200 |
5 | 140040141024300 |
6 | 5022035455040 |
7 | 540144253536 |
oct | 122115215340 |
9 | 31412514056 |
10 | 11026111200 |
11 | 4748a525a5 |
12 | 2178757480 |
13 | 106946a570 |
14 | 76854a156 |
15 | 447eeada0 |
hex | 291351ae0 |
11026111200 has 144 divisors (see below), whose sum is σ = 38650869936. Its totient is φ = 2714112000.
The previous prime is 11026111139. The next prime is 11026111207. The reversal of 11026111200 is 211162011.
It is a happy number.
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 11026111200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11026111207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145501 + ... + 207900.
It is an arithmetic number, because the mean of its divisors is an integer number (268408819).
Almost surely, 211026111200 is an apocalyptic number.
11026111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11026111200 is an abundant number, since it is smaller than the sum of its proper divisors (27624758736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11026111200 is a wasteful number, since it uses less digits than its factorization.
11026111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353437 (or 353424 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11026111200 its reverse (211162011), we get a palindrome (11237273211).
The spelling of 11026111200 in words is "eleven billion, twenty-six million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •