Base | Representation |
---|---|
bin | 100100011001011… |
… | …1100011101101101 |
3 | 10011010010012102011 |
4 | 1020302330131231 |
5 | 10000124030123 |
6 | 321105001221 |
7 | 42160000264 |
oct | 11062743555 |
9 | 3133105364 |
10 | 1221314413 |
11 | 577444660 |
12 | 2a1023211 |
13 | 166047c67 |
14 | b82bb5db |
15 | 7234ae0d |
hex | 48cbc76d |
1221314413 has 4 divisors (see below), whose sum is σ = 1332343008. Its totient is φ = 1110285820.
The previous prime is 1221314401. The next prime is 1221314429. The reversal of 1221314413 is 3144131221.
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 1221314413 - 225 = 1187759981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221314453) 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 3 ways as a sum of consecutive naturals, for example, 55514281 + ... + 55514302.
It is an arithmetic number, because the mean of its divisors is an integer number (333085752).
Almost surely, 21221314413 is an apocalyptic number.
It is an amenable number.
1221314413 is a deficient number, since it is larger than the sum of its proper divisors (111028595).
1221314413 is a wasteful number, since it uses less digits than its factorization.
1221314413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111028594.
The product of its digits is 576, while the sum is 22.
The square root of 1221314413 is about 34947.3090952651. The cubic root of 1221314413 is about 1068.9133326835.
Adding to 1221314413 its reverse (3144131221), we get a palindrome (4365445634).
The spelling of 1221314413 in words is "one billion, two hundred twenty-one million, three hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •