Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000001000110000111 |
3 | 101121210110001212112101 |
4 | 1213132223001012013 |
5 | 3310023130013111 |
6 | 123013200532531 |
7 | 11012260266031 |
oct | 1473653010607 |
9 | 347713055471 |
10 | 111110001031 |
11 | 43137776337 |
12 | 1964a621147 |
13 | a62946ca53 |
14 | 55407a6c51 |
15 | 2d547a6bc1 |
hex | 19deac1187 |
111110001031 has 2 divisors, whose sum is σ = 111110001032. Its totient is φ = 111110001030.
The previous prime is 111110000999. The next prime is 111110001061. The reversal of 111110001031 is 130100011111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111110001031 - 25 = 111110000999 is a prime.
It is a super-2 number, since 2×1111100010312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111110000999 and 111110001017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111110001061) 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, 55555000515 + 55555000516.
It is an arithmetic number, because the mean of its divisors is an integer number (55555000516).
Almost surely, 2111110001031 is an apocalyptic number.
111110001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110001031 is an equidigital number, since it uses as much as digits as its factorization.
111110001031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 111110001031 its reverse (130100011111), we get a palindrome (241210012142).
The spelling of 111110001031 in words is "one hundred eleven billion, one hundred ten million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •