Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01110010111000100 |
3 | 1001122120122112220210 |
4 | 22111213032113010 |
5 | 140213101202322 |
6 | 5033235555420 |
7 | 542032426536 |
oct | 122547162704 |
9 | 31576575823 |
10 | 11100022212 |
11 | 4786744a84 |
12 | 219945bb70 |
13 | 107b8782a6 |
14 | 7742a9856 |
15 | 44e74a70c |
hex | 2959ce5c4 |
11100022212 has 24 divisors (see below), whose sum is σ = 25904340000. Its totient is φ = 3699394816.
The previous prime is 11100022207. The next prime is 11100022247. The reversal of 11100022212 is 21222000111.
11100022212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2164 + ... + 149012.
It is an arithmetic number, because the mean of its divisors is an integer number (1079347500).
Almost surely, 211100022212 is an apocalyptic number.
11100022212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11100022212 is an abundant number, since it is smaller than the sum of its proper divisors (14804317788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100022212 is a wasteful number, since it uses less digits than its factorization.
11100022212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153155 (or 153153 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11100022212 its reverse (21222000111), we get a palindrome (32322022323).
The spelling of 11100022212 in words is "eleven billion, one hundred million, twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •