Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …100101011101111110111 |
3 | 11021212220101110100210122 |
4 | 101220330310223233313 |
5 | 124330042003033421 |
6 | 2324513315042155 |
7 | 153402322241156 |
oct | 21507464535767 |
9 | 4255811410718 |
10 | 1212201221111 |
11 | 428100a95101 |
12 | 176b238a035b |
13 | 8a40534357a |
14 | 42956b6559d |
15 | 217eae572ab |
hex | 11a3cd2bbf7 |
1212201221111 has 8 divisors (see below), whose sum is σ = 1351060184880. Its totient is φ = 1080848147328.
The previous prime is 1212201221093. The next prime is 1212201221123. The reversal of 1212201221111 is 1111221022121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1212201221111 - 26 = 1212201221047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1212201221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212201221191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1876472156 + ... + 1876472801.
It is an arithmetic number, because the mean of its divisors is an integer number (168882523110).
Almost surely, 21212201221111 is an apocalyptic number.
1212201221111 is a deficient number, since it is larger than the sum of its proper divisors (138858963769).
1212201221111 is a wasteful number, since it uses less digits than its factorization.
1212201221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3752944993.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1212201221111 its reverse (1111221022121), we get a palindrome (2323422243232).
The spelling of 1212201221111 in words is "one trillion, two hundred twelve billion, two hundred one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •