Base | Representation |
---|---|
bin | 100100011000111… |
… | …0011001001100001 |
3 | 10011002112221110221 |
4 | 1020301303021201 |
5 | 10000034422423 |
6 | 321054323041 |
7 | 42154306624 |
oct | 11061631141 |
9 | 3132487427 |
10 | 1221014113 |
11 | 577259a80 |
12 | 2a0ab9481 |
13 | 165c71377 |
14 | b823ddbb |
15 | 722dbe5d |
hex | 48c73261 |
1221014113 has 4 divisors (see below), whose sum is σ = 1332015408. Its totient is φ = 1110012820.
The previous prime is 1221014089. The next prime is 1221014131. The reversal of 1221014113 is 3114101221.
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 1221014113 - 213 = 1221005921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221014183) 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, 55500631 + ... + 55500652.
It is an arithmetic number, because the mean of its divisors is an integer number (333003852).
Almost surely, 21221014113 is an apocalyptic number.
It is an amenable number.
1221014113 is a deficient number, since it is larger than the sum of its proper divisors (111001295).
1221014113 is a wasteful number, since it uses less digits than its factorization.
1221014113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111001294.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1221014113 is about 34943.0123629890. The cubic root of 1221014113 is about 1068.8257164281.
Adding to 1221014113 its reverse (3114101221), we get a palindrome (4335115334).
The spelling of 1221014113 in words is "one billion, two hundred twenty-one million, fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •