Base | Representation |
---|---|
bin | 1010000110011101100010… |
… | …0001001101010110000111 |
3 | 1110022201211210212220012002 |
4 | 2201213120201031112013 |
5 | 2423430314444403411 |
6 | 35342025452415515 |
7 | 2224251040160615 |
oct | 241473041152607 |
9 | 43281753786162 |
10 | 11106123044231 |
11 | 35a2097a16846 |
12 | 12b453617759b |
13 | 6273c2650c97 |
14 | 2a57798b46b5 |
15 | 143d6823433b |
hex | a19d884d587 |
11106123044231 has 8 divisors (see below), whose sum is σ = 11768339832480. Its totient is φ = 10444896859648.
The previous prime is 11106123044207. The next prime is 11106123044251. The reversal of 11106123044231 is 13244032160111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11106123044231 is a prime.
It is a super-2 number, since 2×111061230442312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11106123044194 and 11106123044203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11106123044251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 247627826 + ... + 247672671.
It is an arithmetic number, because the mean of its divisors is an integer number (1471042479060).
Almost surely, 211106123044231 is an apocalyptic number.
11106123044231 is a deficient number, since it is larger than the sum of its proper divisors (662216788249).
11106123044231 is a wasteful number, since it uses less digits than its factorization.
11106123044231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 495301833.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 11106123044231 in words is "eleven trillion, one hundred six billion, one hundred twenty-three million, forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •