Base | Representation |
---|---|
bin | 11001010011110011100100… |
… | …110110110010100100111111 |
3 | 112121010100021102221200120001 |
4 | 121103303210312302210333 |
5 | 104042214402233330302 |
6 | 1032424042501135131 |
7 | 32306020244546635 |
oct | 3123634466624477 |
9 | 477110242850501 |
10 | 111312212011327 |
11 | 32516275860228 |
12 | 105990766ba4a7 |
13 | 4a159094318b2 |
14 | 1d6b77b335355 |
15 | cd07457d6787 |
hex | 653ce4db293f |
111312212011327 has 2 divisors, whose sum is σ = 111312212011328. Its totient is φ = 111312212011326.
The previous prime is 111312212011313. The next prime is 111312212011381. The reversal of 111312212011327 is 723110212213111.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111312212011327 is a prime.
It is a super-2 number, since 2×1113122120113272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111312212011295 and 111312212011304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111312212011927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55656106005663 + 55656106005664.
It is an arithmetic number, because the mean of its divisors is an integer number (55656106005664).
Almost surely, 2111312212011327 is an apocalyptic number.
111312212011327 is a deficient number, since it is larger than the sum of its proper divisors (1).
111312212011327 is an equidigital number, since it uses as much as digits as its factorization.
111312212011327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
Adding to 111312212011327 its reverse (723110212213111), we get a palindrome (834422424224438).
The spelling of 111312212011327 in words is "one hundred eleven trillion, three hundred twelve billion, two hundred twelve million, eleven thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •