Base | Representation |
---|---|
bin | 10110100101000100… |
… | …01110001110010111 |
3 | 1011021210220120000120 |
4 | 23102202032032113 |
5 | 144311230333421 |
6 | 5322511043023 |
7 | 606253220652 |
oct | 132242161627 |
9 | 34253816016 |
10 | 12122121111 |
11 | 5160692011 |
12 | 2423810473 |
13 | 11b2552039 |
14 | 82dd2a899 |
15 | 4ae3448c6 |
hex | 2d288e397 |
12122121111 has 16 divisors (see below), whose sum is σ = 16233993216. Its totient is φ = 8045887136.
The previous prime is 12122121103. The next prime is 12122121149. The reversal of 12122121111 is 11112122121.
It is a happy number.
12122121111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12122121111 - 23 = 12122121103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122121511) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 963286 + ... + 975788.
It is an arithmetic number, because the mean of its divisors is an integer number (1014624576).
Almost surely, 212122121111 is an apocalyptic number.
12122121111 is a deficient number, since it is larger than the sum of its proper divisors (4111872105).
12122121111 is a wasteful number, since it uses less digits than its factorization.
12122121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13902.
The product of its digits is 16, while the sum is 15.
Adding to 12122121111 its reverse (11112122121), we get a palindrome (23234243232).
It can be divided in two parts, 12122121 and 111, that multiplied together give a palindrome (1345555431).
The spelling of 12122121111 in words is "twelve billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •