Base | Representation |
---|---|
bin | 110011110101000101… |
… | …1101011011000100111 |
3 | 101122021220102221022001 |
4 | 1213222023223120213 |
5 | 3310422044042411 |
6 | 123044255550131 |
7 | 11020123562323 |
oct | 1475213533047 |
9 | 348256387261 |
10 | 111303112231 |
11 | 43226783673 |
12 | 196a322b347 |
13 | a65a48462c |
14 | 555c2b4983 |
15 | 2d666eedc1 |
hex | 19ea2eb627 |
111303112231 has 2 divisors, whose sum is σ = 111303112232. Its totient is φ = 111303112230.
The previous prime is 111303112229. The next prime is 111303112259. The reversal of 111303112231 is 132211303111.
It is a weak prime.
It is an emirp because it is prime and its reverse (132211303111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111303112231 - 21 = 111303112229 is a prime.
It is a super-2 number, since 2×1113031122312 (a number of 23 digits) contains 22 as substring.
Together with 111303112229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 111303112199 and 111303112208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111303112031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55651556115 + 55651556116.
It is an arithmetic number, because the mean of its divisors is an integer number (55651556116).
Almost surely, 2111303112231 is an apocalyptic number.
111303112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
111303112231 is an equidigital number, since it uses as much as digits as its factorization.
111303112231 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 111303112231 its reverse (132211303111), we get a palindrome (243514415342).
The spelling of 111303112231 in words is "one hundred eleven billion, three hundred three million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •