Base | Representation |
---|---|
bin | 1110011100110… |
… | …00110100111111 |
3 | 22110002012220121 |
4 | 13032120310333 |
5 | 222012242343 |
6 | 20005555411 |
7 | 3001200256 |
oct | 716306477 |
9 | 273065817 |
10 | 121212223 |
11 | 6246a5a0 |
12 | 34715b67 |
13 | 1c15c912 |
14 | 1215379d |
15 | a994aed |
hex | 7398d3f |
121212223 has 8 divisors (see below), whose sum is σ = 132581376. Its totient is φ = 109901400.
The previous prime is 121212209. The next prime is 121212253. The reversal of 121212223 is 322212121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121212223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121212197 and 121212206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121212253) 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 7 ways as a sum of consecutive naturals, for example, 10173 + ... + 18598.
It is an arithmetic number, because the mean of its divisors is an integer number (16572672).
Almost surely, 2121212223 is an apocalyptic number.
121212223 is a deficient number, since it is larger than the sum of its proper divisors (11369153).
121212223 is a wasteful number, since it uses less digits than its factorization.
121212223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29165.
The product of its digits is 96, while the sum is 16.
The square root of 121212223 is about 11009.6422739342. The cubic root of 121212223 is about 494.8977416900.
Adding to 121212223 its reverse (322212121), we get a palindrome (443424344).
The spelling of 121212223 in words is "one hundred twenty-one million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •