Base | Representation |
---|---|
bin | 1010000110110111100011… |
… | …1111001011010011000111 |
3 | 1110100101212202111022012202 |
4 | 2201231320333023103013 |
5 | 2424034122204101043 |
6 | 35345143052105115 |
7 | 2224616142204425 |
oct | 241557077132307 |
9 | 43311782438182 |
10 | 11113110222023 |
11 | 35a5053002947 |
12 | 12b596616519b |
13 | 627c670b7904 |
14 | 2a5c3d854115 |
15 | 1441268691b8 |
hex | a1b78fcb4c7 |
11113110222023 has 4 divisors (see below), whose sum is σ = 11113849583088. Its totient is φ = 11112370860960.
The previous prime is 11113110222013. The next prime is 11113110222037. The reversal of 11113110222023 is 32022201131111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11113110222023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11113110221986 and 11113110222004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113110222013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369657986 + ... + 369688047.
It is an arithmetic number, because the mean of its divisors is an integer number (2778462395772).
Almost surely, 211113110222023 is an apocalyptic number.
11113110222023 is a deficient number, since it is larger than the sum of its proper divisors (739361065).
11113110222023 is an equidigital number, since it uses as much as digits as its factorization.
11113110222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739361064.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11113110222023 its reverse (32022201131111), we get a palindrome (43135311353134).
The spelling of 11113110222023 in words is "eleven trillion, one hundred thirteen billion, one hundred ten million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •