Base | Representation |
---|---|
bin | 110011101111001000… |
… | …0101100100001011111 |
3 | 101121202222002022111112 |
4 | 1213132100230201133 |
5 | 3310014343213043 |
6 | 123012353012235 |
7 | 11012144530265 |
oct | 1473620544137 |
9 | 347688068445 |
10 | 111103101023 |
11 | 43133893252 |
12 | 1964825407b |
13 | a627bc51c5 |
14 | 553d8cc435 |
15 | 2d53d92518 |
hex | 19de42c85f |
111103101023 has 2 divisors, whose sum is σ = 111103101024. Its totient is φ = 111103101022.
The previous prime is 111103101001. The next prime is 111103101037. The reversal of 111103101023 is 320101301111.
It is a happy number.
It is an a-pointer prime, because the next prime (111103101037) can be obtained adding 111103101023 to its sum of digits (14).
It is a strong prime.
It is an emirp because it is prime and its reverse (320101301111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111103101023 - 210 = 111103099999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111103100989 and 111103101007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111103104023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55551550511 + 55551550512.
It is an arithmetic number, because the mean of its divisors is an integer number (55551550512).
Almost surely, 2111103101023 is an apocalyptic number.
111103101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
111103101023 is an equidigital number, since it uses as much as digits as its factorization.
111103101023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 111103101023 its reverse (320101301111), we get a palindrome (431204402134).
The spelling of 111103101023 in words is "one hundred eleven billion, one hundred three million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •