Base | Representation |
---|---|
bin | 100100011011000… |
… | …0001011011111101 |
3 | 10011011122012010122 |
4 | 1020312001123331 |
5 | 10000330334323 |
6 | 321134144325 |
7 | 42166600415 |
oct | 11066013375 |
9 | 3134565118 |
10 | 1222121213 |
11 | 577945835 |
12 | 2a13520a5 |
13 | 16626b261 |
14 | b844b645 |
15 | 72459ec8 |
hex | 48d816fd |
1222121213 has 4 divisors (see below), whose sum is σ = 1248123840. Its totient is φ = 1196118588.
The previous prime is 1222121207. The next prime is 1222121233. The reversal of 1222121213 is 3121212221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1222121213 - 26 = 1222121149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222121191 and 1222121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222121233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13001243 + ... + 13001336.
It is an arithmetic number, because the mean of its divisors is an integer number (312030960).
Almost surely, 21222121213 is an apocalyptic number.
It is an amenable number.
1222121213 is a deficient number, since it is larger than the sum of its proper divisors (26002627).
1222121213 is an equidigital number, since it uses as much as digits as its factorization.
1222121213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26002626.
The product of its digits is 96, while the sum is 17.
The square root of 1222121213 is about 34958.8502814380. The cubic root of 1222121213 is about 1069.1486555010.
Adding to 1222121213 its reverse (3121212221), we get a palindrome (4343333434).
The spelling of 1222121213 in words is "one billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •