Base | Representation |
---|---|
bin | 10100111001110001… |
… | …11111111011011000 |
3 | 1001222002101212121120 |
4 | 22130320333323120 |
5 | 140440330402300 |
6 | 5053321005240 |
7 | 545044315302 |
oct | 123470777330 |
9 | 31862355546 |
10 | 11222122200 |
11 | 4839660563 |
12 | 2212323820 |
13 | 109ac58cc3 |
14 | 7865b0972 |
15 | 45a3183a0 |
hex | 29ce3fed8 |
11222122200 has 96 divisors (see below), whose sum is σ = 35728881360. Its totient is φ = 2911680000.
The previous prime is 11222122193. The next prime is 11222122201. The reversal of 11222122200 is 222122211.
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 11222122200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222122201) 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, 230551 + ... + 274950.
Almost surely, 211222122200 is an apocalyptic number.
11222122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222122200 is an abundant number, since it is smaller than the sum of its proper divisors (24506759160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222122200 is a wasteful number, since it uses less digits than its factorization.
11222122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505557 (or 505548 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 11222122200 its reverse (222122211), we get a palindrome (11444244411).
It can be divided in two parts, 112221 and 22200, that added together give a triangular number (134421 = T518).
The spelling of 11222122200 in words is "eleven billion, two hundred twenty-two million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •