Base | Representation |
---|---|
bin | 100001001100110… |
… | …1111011100010101 |
3 | 2212122021022022121 |
4 | 1002121233130111 |
5 | 4240143403211 |
6 | 302313455541 |
7 | 36415135135 |
oct | 10231573425 |
9 | 2778238277 |
10 | 1114044181 |
11 | 521937978 |
12 | 2711115b1 |
13 | 149a5a253 |
14 | a7d56ac5 |
15 | 67c0c271 |
hex | 4266f715 |
1114044181 has 2 divisors, whose sum is σ = 1114044182. Its totient is φ = 1114044180.
The previous prime is 1114044163. The next prime is 1114044199. The reversal of 1114044181 is 1814404111.
It is a balanced prime because it is at equal distance from previous prime (1114044163) and next prime (1114044199).
It can be written as a sum of positive squares in only one way, i.e., 1072235025 + 41809156 = 32745^2 + 6466^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114044181 - 215 = 1114011413 is a prime.
It is a super-2 number, since 2×11140441812 = 2482188874439921522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1114024181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557022090 + 557022091.
It is an arithmetic number, because the mean of its divisors is an integer number (557022091).
Almost surely, 21114044181 is an apocalyptic number.
It is an amenable number.
1114044181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114044181 is an equidigital number, since it uses as much as digits as its factorization.
1114044181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 25.
The square root of 1114044181 is about 33377.3003851420. The cubic root of 1114044181 is about 1036.6547408992.
Adding to 1114044181 its reverse (1814404111), we get a palindrome (2928448292).
The spelling of 1114044181 in words is "one billion, one hundred fourteen million, forty-four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •