Base | Representation |
---|---|
bin | 100100011001101… |
… | …0010011000101001 |
3 | 10011010021202120122 |
4 | 1020303102120221 |
5 | 10000134413301 |
6 | 321110533025 |
7 | 42160523123 |
oct | 11063223051 |
9 | 3133252518 |
10 | 1221404201 |
11 | 5774a6066 |
12 | 2a1067175 |
13 | 166079aa4 |
14 | b8302213 |
15 | 7236781b |
hex | 48cd2629 |
1221404201 has 2 divisors, whose sum is σ = 1221404202. Its totient is φ = 1221404200.
The previous prime is 1221404161. The next prime is 1221404209. The reversal of 1221404201 is 1024041221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1171008400 + 50395801 = 34220^2 + 7099^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221404201 - 230 = 147662377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1221404201.
It is not a weakly prime, because it can be changed into another prime (1221404209) 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 as a sum of consecutive naturals, namely, 610702100 + 610702101.
It is an arithmetic number, because the mean of its divisors is an integer number (610702101).
Almost surely, 21221404201 is an apocalyptic number.
It is an amenable number.
1221404201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221404201 is an equidigital number, since it uses as much as digits as its factorization.
1221404201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 1221404201 is about 34948.5936913061. The cubic root of 1221404201 is about 1068.9395266587.
Adding to 1221404201 its reverse (1024041221), we get a palindrome (2245445422).
The spelling of 1221404201 in words is "one billion, two hundred twenty-one million, four hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •