Base | Representation |
---|---|
bin | 10110110000110000… |
… | …00001100011111101 |
3 | 1011112122021222000110 |
4 | 23120120001203331 |
5 | 200011322023401 |
6 | 5340331220233 |
7 | 611553142032 |
oct | 133030014375 |
9 | 34478258013 |
10 | 12220111101 |
11 | 5200a30380 |
12 | 24505a7679 |
13 | 11c9940993 |
14 | 83cd57389 |
15 | 4b7c4d9d6 |
hex | 2d86018fd |
12220111101 has 16 divisors (see below), whose sum is σ = 18255106368. Its totient is φ = 7205961600.
The previous prime is 12220111097. The next prime is 12220111103. The reversal of 12220111101 is 10111102221.
It is not a de Polignac number, because 12220111101 - 22 = 12220111097 is a prime.
It is a super-2 number, since 2×122201111012 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220111103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5002920 + ... + 5005361.
It is an arithmetic number, because the mean of its divisors is an integer number (1140944148).
Almost surely, 212220111101 is an apocalyptic number.
12220111101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12220111101 is a deficient number, since it is larger than the sum of its proper divisors (6034995267).
12220111101 is a wasteful number, since it uses less digits than its factorization.
12220111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10008332.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12220111101 its reverse (10111102221), we get a palindrome (22331213322).
It can be divided in two parts, 12220 and 111101, that added together give a palindrome (123321).
The spelling of 12220111101 in words is "twelve billion, two hundred twenty million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •