Base | Representation |
---|---|
bin | 11110110111011100101… |
… | …011010010011100111111 |
3 | 21111202222120202221111011 |
4 | 132313130223102130333 |
5 | 234223024012242343 |
6 | 4302232444540051 |
7 | 306150234551536 |
oct | 36673453223477 |
9 | 7452876687434 |
10 | 2121121212223 |
11 | 748620699282 |
12 | 2a3107251627 |
13 | 125036b18510 |
14 | 7493ca9731d |
15 | 3a29660929d |
hex | 1eddcad273f |
2121121212223 has 16 divisors (see below), whose sum is σ = 2385619782336. Its totient is φ = 1871243320320.
The previous prime is 2121121212209. The next prime is 2121121212277. The reversal of 2121121212223 is 3222121211212.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121121212223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121121212194 and 2121121212203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121121212293) 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, 2650290 + ... + 3356527.
It is an arithmetic number, because the mean of its divisors is an integer number (149101236396).
Almost surely, 22121121212223 is an apocalyptic number.
2121121212223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2121121212223 is a deficient number, since it is larger than the sum of its proper divisors (264498570113).
2121121212223 is a wasteful number, since it uses less digits than its factorization.
2121121212223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6008034.
The product of its digits is 384, while the sum is 22.
Adding to 2121121212223 its reverse (3222121211212), we get a palindrome (5343242423435).
The spelling of 2121121212223 in words is "two trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •