Base | Representation |
---|---|
bin | 111100011100100… |
… | …100011011101101 |
3 | 2121200020202011021 |
4 | 330130210123231 |
5 | 4034103402341 |
6 | 244344054141 |
7 | 34062616360 |
oct | 7434443355 |
9 | 2550222137 |
10 | 1014122221 |
11 | 48049a042 |
12 | 243764351 |
13 | 132143128 |
14 | 989860d7 |
15 | 5e0709d1 |
hex | 3c7246ed |
1014122221 has 8 divisors (see below), whose sum is σ = 1167845184. Its totient is φ = 862611360.
The previous prime is 1014122201. The next prime is 1014122269. The reversal of 1014122221 is 1222214101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1014122221 - 229 = 477251309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1014122195 and 1014122204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014122201) 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 7 ways as a sum of consecutive naturals, for example, 552040 + ... + 553873.
It is an arithmetic number, because the mean of its divisors is an integer number (145980648).
Almost surely, 21014122221 is an apocalyptic number.
It is an amenable number.
1014122221 is a deficient number, since it is larger than the sum of its proper divisors (153722963).
1014122221 is a wasteful number, since it uses less digits than its factorization.
1014122221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106051.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 1014122221 is about 31845.2856950601. The cubic root of 1014122221 is about 1004.6854195570.
Adding to 1014122221 its reverse (1222214101), we get a palindrome (2236336322).
The spelling of 1014122221 in words is "one billion, fourteen million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •