Base | Representation |
---|---|
bin | 10000001010000101100… |
… | …011001000000101000011 |
3 | 10221010222122121221000101 |
4 | 100022011203020011003 |
5 | 121142440041441402 |
6 | 2210030101303231 |
7 | 143135212316605 |
oct | 20120543100503 |
9 | 3833878557011 |
10 | 1110342140227 |
11 | 398991212021 |
12 | 15b237404b17 |
13 | 80921629288 |
14 | 3ba52c4d175 |
15 | 1dd388e3b87 |
hex | 102858c8143 |
1110342140227 has 2 divisors, whose sum is σ = 1110342140228. Its totient is φ = 1110342140226.
The previous prime is 1110342140177. The next prime is 1110342140287. The reversal of 1110342140227 is 7220412430111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1110342140227 - 235 = 1075982401859 is a prime.
It is a super-2 number, since 2×11103421402272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110342140195 and 1110342140204.
It is not a weakly prime, because it can be changed into another prime (1110342140287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555171070113 + 555171070114.
It is an arithmetic number, because the mean of its divisors is an integer number (555171070114).
Almost surely, 21110342140227 is an apocalyptic number.
1110342140227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110342140227 is an equidigital number, since it uses as much as digits as its factorization.
1110342140227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 28.
Adding to 1110342140227 its reverse (7220412430111), we get a palindrome (8330754570338).
The spelling of 1110342140227 in words is "one trillion, one hundred ten billion, three hundred forty-two million, one hundred forty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •