Base | Representation |
---|---|
bin | 100100010111110… |
… | …0000011100011101 |
3 | 10011001102102012101 |
4 | 1020233200130131 |
5 | 4444411210323 |
6 | 321033405101 |
7 | 42146225005 |
oct | 11057403435 |
9 | 3131372171 |
10 | 1220413213 |
11 | 576989568 |
12 | 2a0869791 |
13 | 165ac09c6 |
14 | b8125005 |
15 | 7221ddad |
hex | 48be071d |
1220413213 has 2 divisors, whose sum is σ = 1220413214. Its totient is φ = 1220413212.
The previous prime is 1220413211. The next prime is 1220413223. The reversal of 1220413213 is 3123140221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 756140004 + 464273209 = 27498^2 + 21547^2 .
It is an emirp because it is prime and its reverse (3123140221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1220413213 - 21 = 1220413211 is a prime.
Together with 1220413211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220413211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610206606 + 610206607.
It is an arithmetic number, because the mean of its divisors is an integer number (610206607).
Almost surely, 21220413213 is an apocalyptic number.
It is an amenable number.
1220413213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220413213 is an equidigital number, since it uses as much as digits as its factorization.
1220413213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1220413213 is about 34934.4130192565. The cubic root of 1220413213 is about 1068.6503532462.
Adding to 1220413213 its reverse (3123140221), we get a palindrome (4343553434).
The spelling of 1220413213 in words is "one billion, two hundred twenty million, four hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •