Base | Representation |
---|---|
bin | 100001011100011… |
… | …1011110000101101 |
3 | 2220012122201221111 |
4 | 1002320323300231 |
5 | 4244242033401 |
6 | 303205032021 |
7 | 36544502431 |
oct | 10270736055 |
9 | 2805581844 |
10 | 1122221101 |
11 | 526512361 |
12 | 2739b5611 |
13 | 14b661071 |
14 | a90849c1 |
15 | 687c4e51 |
hex | 42e3bc2d |
1122221101 has 4 divisors (see below), whose sum is σ = 1138027104. Its totient is φ = 1106415100.
The previous prime is 1122221077. The next prime is 1122221143. The reversal of 1122221101 is 1011222211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1122221101 - 27 = 1122220973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122227101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7902895 + ... + 7903036.
It is an arithmetic number, because the mean of its divisors is an integer number (284506776).
Almost surely, 21122221101 is an apocalyptic number.
It is an amenable number.
1122221101 is a deficient number, since it is larger than the sum of its proper divisors (15806003).
1122221101 is an equidigital number, since it uses as much as digits as its factorization.
1122221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15806002.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 1122221101 is about 33499.5686688650. The cubic root of 1122221101 is about 1039.1848583701.
Adding to 1122221101 its reverse (1011222211), we get a palindrome (2133443312).
It can be divided in two parts, 11222 and 21101, that added together give a palindrome (32323).
The spelling of 1122221101 in words is "one billion, one hundred twenty-two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •