Base | Representation |
---|---|
bin | 10000001001110111111… |
… | …010001011011011010111 |
3 | 10221010101201000202022001 |
4 | 100021313322023123113 |
5 | 121142003001132411 |
6 | 2205551244420131 |
7 | 143126433243463 |
oct | 20116772133327 |
9 | 3833351022261 |
10 | 1110113302231 |
11 | 39888402270a |
12 | 15b192847647 |
13 | 808b60b5b8b |
14 | 3ba306c14a3 |
15 | 1dd2378edc1 |
hex | 10277e8b6d7 |
1110113302231 has 2 divisors, whose sum is σ = 1110113302232. Its totient is φ = 1110113302230.
The previous prime is 1110113302171. The next prime is 1110113302237. The reversal of 1110113302231 is 1322033110111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110113302231 - 211 = 1110113300183 is a prime.
It is a super-2 number, since 2×11101133022312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110113302199 and 1110113302208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110113302237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555056651115 + 555056651116.
It is an arithmetic number, because the mean of its divisors is an integer number (555056651116).
Almost surely, 21110113302231 is an apocalyptic number.
1110113302231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110113302231 is an equidigital number, since it uses as much as digits as its factorization.
1110113302231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1110113302231 its reverse (1322033110111), we get a palindrome (2432146412342).
The spelling of 1110113302231 in words is "one trillion, one hundred ten billion, one hundred thirteen million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •