Base | Representation |
---|---|
bin | 10000001001110111111… |
… | …010010000110110001111 |
3 | 10221010101201001212202021 |
4 | 100021313322100312033 |
5 | 121142003002340211 |
6 | 2205551245111011 |
7 | 143126433365266 |
oct | 20116772206617 |
9 | 3833351055667 |
10 | 1110113324431 |
11 | 398884038361 |
12 | 15b192858467 |
13 | 808b60c3007 |
14 | 3ba306c95dd |
15 | 1dd23796771 |
hex | 10277e90d8f |
1110113324431 has 2 divisors, whose sum is σ = 1110113324432. Its totient is φ = 1110113324430.
The previous prime is 1110113324423. The next prime is 1110113324563. The reversal of 1110113324431 is 1344233110111.
It is a weak prime.
It is an emirp because it is prime and its reverse (1344233110111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110113324431 - 23 = 1110113324423 is a prime.
It is a super-2 number, since 2×11101133244312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110113324396 and 1110113324405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110113384431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555056662215 + 555056662216.
It is an arithmetic number, because the mean of its divisors is an integer number (555056662216).
Almost surely, 21110113324431 is an apocalyptic number.
1110113324431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110113324431 is an equidigital number, since it uses as much as digits as its factorization.
1110113324431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 1110113324431 its reverse (1344233110111), we get a palindrome (2454346434542).
The spelling of 1110113324431 in words is "one trillion, one hundred ten billion, one hundred thirteen million, three hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.218 sec. • engine limits •