Base | Representation |
---|---|
bin | 1010000111011100011111… |
… | …0001101110110011101111 |
3 | 1110101100110112022102112002 |
4 | 2201313013301232303233 |
5 | 2424214422120011421 |
6 | 35353502404402515 |
7 | 2225416566203063 |
oct | 241670761566357 |
9 | 43340415272462 |
10 | 11123022032111 |
11 | 35a9279a62530 |
12 | 12b78716a643b |
13 | 628b86737cb2 |
14 | 2a64dddbbaa3 |
15 | 144506b06b0b |
hex | a1dc7c6ecef |
11123022032111 has 8 divisors (see below), whose sum is σ = 12254346506448. Its totient is φ = 10011721000000.
The previous prime is 11123022032107. The next prime is 11123022032141.
11123022032111 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11123022032111 - 22 = 11123022032107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123022032141) 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, 5005859390 + ... + 5005861611.
It is an arithmetic number, because the mean of its divisors is an integer number (1531793313306).
Almost surely, 211123022032111 is an apocalyptic number.
11123022032111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11123022032111 is a deficient number, since it is larger than the sum of its proper divisors (1131324474337).
11123022032111 is a wasteful number, since it uses less digits than its factorization.
11123022032111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011721113.
The product of its (nonzero) digits is 144, while the sum is 20.
It can be divided in two parts, 1112302 and 2032111, that added together give a palindrome (3144413).
The spelling of 11123022032111 in words is "eleven trillion, one hundred twenty-three billion, twenty-two million, thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •