Base | Representation |
---|---|
bin | 100001001101100… |
… | …1011011101110111 |
3 | 2212122222110100222 |
4 | 1002123023131313 |
5 | 4240242433421 |
6 | 302325524555 |
7 | 36421265066 |
oct | 10233133567 |
9 | 2778873328 |
10 | 1114421111 |
11 | 522075091 |
12 | 27127375b |
13 | 149b5c99b |
14 | a80141dd |
15 | 67c83cab |
hex | 426cb777 |
1114421111 has 8 divisors (see below), whose sum is σ = 1180979424. Its totient is φ = 1047974400.
The previous prime is 1114421107. The next prime is 1114421131. The reversal of 1114421111 is 1111244111.
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 1114421111 - 22 = 1114421107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1114421111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114421131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6875 + ... + 47708.
It is an arithmetic number, because the mean of its divisors is an integer number (147622428).
Almost surely, 21114421111 is an apocalyptic number.
1114421111 is a deficient number, since it is larger than the sum of its proper divisors (66558313).
1114421111 is a wasteful number, since it uses less digits than its factorization.
1114421111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55801.
The product of its digits is 32, while the sum is 17.
The square root of 1114421111 is about 33382.9464098063. The cubic root of 1114421111 is about 1036.7716429687.
Adding to 1114421111 its reverse (1111244111), we get a palindrome (2225665222).
The spelling of 1114421111 in words is "one billion, one hundred fourteen million, four hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •