Base | Representation |
---|---|
bin | 1010000111011100110101… |
… | …0001110111101001110111 |
3 | 1110101100200222000022022001 |
4 | 2201313031101313221313 |
5 | 2424220114232434111 |
6 | 35353515503120131 |
7 | 2225422066632115 |
oct | 241671521675167 |
9 | 43340628008261 |
10 | 11123114343031 |
11 | 35a9317082049 |
12 | 12b78985a3047 |
13 | 628b9c8b8a42 |
14 | 2a650c36aab5 |
15 | 14450ec8d1c1 |
hex | a1dcd477a77 |
11123114343031 has 4 divisors (see below), whose sum is σ = 11305460479864. Its totient is φ = 10940768206200.
The previous prime is 11123114343023. The next prime is 11123114343041. The reversal of 11123114343031 is 13034341132111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11123114343031 - 23 = 11123114343023 is a prime.
It is a super-2 number, since 2×111231143430312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123114343041) 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, 91173068325 + ... + 91173068446.
It is an arithmetic number, because the mean of its divisors is an integer number (2826365119966).
Almost surely, 211123114343031 is an apocalyptic number.
11123114343031 is a deficient number, since it is larger than the sum of its proper divisors (182346136833).
11123114343031 is an equidigital number, since it uses as much as digits as its factorization.
11123114343031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182346136832.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 11123114343031 its reverse (13034341132111), we get a palindrome (24157455475142).
The spelling of 11123114343031 in words is "eleven trillion, one hundred twenty-three billion, one hundred fourteen million, three hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •