Base | Representation |
---|---|
bin | 1011000110110101101100… |
… | …1001011001010011011001 |
3 | 1121020110121201120011102010 |
4 | 2301231123021121103121 |
5 | 3100040411012241441 |
6 | 41550100535500133 |
7 | 2400203514403245 |
oct | 261553311312331 |
9 | 47213551504363 |
10 | 12212121212121 |
11 | 398914a067086 |
12 | 145295a827649 |
13 | 6a77a100310c |
14 | 3030d9831425 |
15 | 1629ea5aa116 |
hex | b1b5b2594d9 |
12212121212121 has 16 divisors (see below), whose sum is σ = 16347987165888. Its totient is φ = 8108835840000.
The previous prime is 12212121212119. The next prime is 12212121212143. The reversal of 12212121212121 is 12121212121221.
It is not a de Polignac number, because 12212121212121 - 21 = 12212121212119 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12212121212101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59155801 + ... + 59361881.
It is an arithmetic number, because the mean of its divisors is an integer number (1021749197868).
Almost surely, 212212121212121 is an apocalyptic number.
It is an amenable number.
12212121212121 is a deficient number, since it is larger than the sum of its proper divisors (4135865953767).
12212121212121 is a wasteful number, since it uses less digits than its factorization.
12212121212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285032.
The product of its digits is 128, while the sum is 21.
Adding to 12212121212121 its reverse (12121212121221), we get a palindrome (24333333333342).
It can be divided in two parts, 12 and 212121212121, that multiplied together give a palindrome (2545454545452).
The spelling of 12212121212121 in words is "twelve trillion, two hundred twelve billion, one hundred twenty-one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •