Base | Representation |
---|---|
bin | 101110001111… |
… | …010010000111 |
3 | 211210211012012 |
4 | 232033102013 |
5 | 11100334343 |
6 | 1111444435 |
7 | 205012562 |
oct | 56172207 |
9 | 24724165 |
10 | 12121223 |
11 | 6929944 |
12 | 408671b |
13 | 268522a |
14 | 18774d9 |
15 | 10e6718 |
hex | b8f487 |
12121223 has 4 divisors (see below), whose sum is σ = 12201648. Its totient is φ = 12040800.
The previous prime is 12121211. The next prime is 12121231. The reversal of 12121223 is 32212121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32212121 = 23 ⋅1400527.
It is a cyclic number.
It is not a de Polignac number, because 12121223 - 28 = 12120967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12121198 and 12121207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12121273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39986 + ... + 40287.
It is an arithmetic number, because the mean of its divisors is an integer number (3050412).
Almost surely, 212121223 is an apocalyptic number.
12121223 is a deficient number, since it is larger than the sum of its proper divisors (80425).
12121223 is an equidigital number, since it uses as much as digits as its factorization.
12121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80424.
The product of its digits is 48, while the sum is 14.
The square root of 12121223 is about 3481.5546814606. The cubic root of 12121223 is about 229.7111875828.
Adding to 12121223 its reverse (32212121), we get a palindrome (44333344).
The spelling of 12121223 in words is "twelve million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •