Base | Representation |
---|---|
bin | 100001011100110… |
… | …1010111101010101 |
3 | 2220020000120010111 |
4 | 1002321222331111 |
5 | 4244314230141 |
6 | 303213123021 |
7 | 36546236152 |
oct | 10271527525 |
9 | 2806016114 |
10 | 1122414421 |
11 | 526634627 |
12 | 273a89471 |
13 | 14b6cb05b |
14 | a90d5229 |
15 | 68812381 |
hex | 42e6af55 |
1122414421 has 8 divisors (see below), whose sum is σ = 1171719360. Its totient is φ = 1073151552.
The previous prime is 1122414413. The next prime is 1122414431. The reversal of 1122414421 is 1244142211.
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 1122414421 - 23 = 1122414413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122414392 and 1122414401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122414431) 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, 51981 + ... + 70333.
It is an arithmetic number, because the mean of its divisors is an integer number (146464920).
Almost surely, 21122414421 is an apocalyptic number.
It is an amenable number.
1122414421 is a deficient number, since it is larger than the sum of its proper divisors (49304939).
1122414421 is a wasteful number, since it uses less digits than its factorization.
1122414421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21035.
The product of its digits is 512, while the sum is 22.
The square root of 1122414421 is about 33502.4539548971. The cubic root of 1122414421 is about 1039.2445268502.
Adding to 1122414421 its reverse (1244142211), we get a palindrome (2366556632).
The spelling of 1122414421 in words is "one billion, one hundred twenty-two million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •