Base | Representation |
---|---|
bin | 10000001010111110110… |
… | …000110010010001010111 |
3 | 10221020110112210222120201 |
4 | 100022332300302101113 |
5 | 121201421304202411 |
6 | 2210305231041331 |
7 | 143201046221452 |
oct | 20127660622127 |
9 | 3836415728521 |
10 | 1111302022231 |
11 | 399334024635 |
12 | 15b464970247 |
13 | 80a4545acab |
14 | 3bb04516499 |
15 | 1dd92ced3c1 |
hex | 102bec32457 |
1111302022231 has 2 divisors, whose sum is σ = 1111302022232. Its totient is φ = 1111302022230.
The previous prime is 1111302022217. The next prime is 1111302022297. The reversal of 1111302022231 is 1322202031111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1111302022231 - 211 = 1111302020183 is a prime.
It is a super-2 number, since 2×11113020222312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111302022199 and 1111302022208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111302022931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555651011115 + 555651011116.
It is an arithmetic number, because the mean of its divisors is an integer number (555651011116).
Almost surely, 21111302022231 is an apocalyptic number.
1111302022231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111302022231 is an equidigital number, since it uses as much as digits as its factorization.
1111302022231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1111302022231 its reverse (1322202031111), we get a palindrome (2433504053342).
The spelling of 1111302022231 in words is "one trillion, one hundred eleven billion, three hundred two million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •