Base | Representation |
---|---|
bin | 10000010011000101111… |
… | …000100101000001100111 |
3 | 10222001221112010021000202 |
4 | 100103011320211001213 |
5 | 121322240412041411 |
6 | 2214305352101115 |
7 | 143626633106615 |
oct | 20230570450147 |
9 | 3861845107022 |
10 | 1120011440231 |
11 | 3a1aa3294252 |
12 | 16109569479b |
13 | 8180295a178 |
14 | 3c2cd0ca6b5 |
15 | 1e20272b83b |
hex | 104c5e25067 |
1120011440231 has 2 divisors, whose sum is σ = 1120011440232. Its totient is φ = 1120011440230.
The previous prime is 1120011440213. The next prime is 1120011440291. The reversal of 1120011440231 is 1320441100211.
Together with previous prime (1120011440213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1120011440231 - 26 = 1120011440167 is a prime.
It is a super-2 number, since 2×11200114402312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120011440291) 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 as a sum of consecutive naturals, namely, 560005720115 + 560005720116.
It is an arithmetic number, because the mean of its divisors is an integer number (560005720116).
Almost surely, 21120011440231 is an apocalyptic number.
1120011440231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120011440231 is an equidigital number, since it uses as much as digits as its factorization.
1120011440231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1120011440231 its reverse (1320441100211), we get a palindrome (2440452540442).
The spelling of 1120011440231 in words is "one trillion, one hundred twenty billion, eleven million, four hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •