Base | Representation |
---|---|
bin | 100001011100110… |
… | …1011010111110010 |
3 | 2220020000122110012 |
4 | 1002321223113302 |
5 | 4244314303424 |
6 | 303213134522 |
7 | 36546244121 |
oct | 10271532762 |
9 | 2806018405 |
10 | 1122416114 |
11 | 526635926 |
12 | 273a8a442 |
13 | 14b6cba61 |
14 | a90d5ab8 |
15 | 68812b0e |
hex | 42e6b5f2 |
1122416114 has 8 divisors (see below), whose sum is σ = 1692926508. Its totient is φ = 558107280.
The previous prime is 1122416111. The next prime is 1122416137. The reversal of 1122416114 is 4116142211.
It can be written as a sum of positive squares in 2 ways, for example, as 1119237025 + 3179089 = 33455^2 + 1783^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×11224161144 (a number of 37 digits) contains 4444 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1122416114.
It is not an unprimeable number, because it can be changed into a prime (1122416111) 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, 1549937 + ... + 1550660.
Almost surely, 21122416114 is an apocalyptic number.
1122416114 is a deficient number, since it is larger than the sum of its proper divisors (570510394).
1122416114 is a wasteful number, since it uses less digits than its factorization.
1122416114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3100780.
The product of its digits is 384, while the sum is 23.
The square root of 1122416114 is about 33502.4792216934. The cubic root of 1122416114 is about 1039.2450493666.
Adding to 1122416114 its reverse (4116142211), we get a palindrome (5238558325).
The spelling of 1122416114 in words is "one billion, one hundred twenty-two million, four hundred sixteen thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •