Base | Representation |
---|---|
bin | 100001111110100… |
… | …1100001100000101 |
3 | 2221110022210122011 |
4 | 1003331030030011 |
5 | 4313332123211 |
6 | 305044334221 |
7 | 40152545023 |
oct | 10375141405 |
9 | 2843283564 |
10 | 1140114181 |
11 | 535623728 |
12 | 2799a4371 |
13 | 15228749b |
14 | ab5c1713 |
15 | 6a15b921 |
hex | 43f4c305 |
1140114181 has 2 divisors, whose sum is σ = 1140114182. Its totient is φ = 1140114180.
The previous prime is 1140114121. The next prime is 1140114223. The reversal of 1140114181 is 1814110411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 840478081 + 299636100 = 28991^2 + 17310^2 .
It is an emirp because it is prime and its reverse (1814110411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1140114181 - 227 = 1005896453 is a prime.
It is a super-2 number, since 2×11401141812 = 2599720691434601522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1140114121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570057090 + 570057091.
It is an arithmetic number, because the mean of its divisors is an integer number (570057091).
Almost surely, 21140114181 is an apocalyptic number.
It is an amenable number.
1140114181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140114181 is an equidigital number, since it uses as much as digits as its factorization.
1140114181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 22.
The square root of 1140114181 is about 33765.5768646117. The cubic root of 1140114181 is about 1044.6788024089.
Adding to 1140114181 its reverse (1814110411), we get a palindrome (2954224592).
The spelling of 1140114181 in words is "one billion, one hundred forty million, one hundred fourteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •