Base | Representation |
---|---|
bin | 1010000110110111010001… |
… | …0100110100110111011111 |
3 | 1110100101200022022210011202 |
4 | 2201231310110310313133 |
5 | 2424033442143324411 |
6 | 35345131215510115 |
7 | 2224614202342553 |
oct | 241556424646737 |
9 | 43311608283152 |
10 | 11113032011231 |
11 | 35a5012943a27 |
12 | 12b5943b2833b |
13 | 627c53b32a37 |
14 | 2a5c332d5863 |
15 | 14411ea6a83b |
hex | a1b74534ddf |
11113032011231 has 8 divisors (see below), whose sum is σ = 11131523658000. Its totient is φ = 11094552106560.
The previous prime is 11113032011219. The next prime is 11113032011299. The reversal of 11113032011231 is 13211023031111.
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 11113032011231 - 222 = 11113027816927 is a prime.
It is a super-2 number, since 2×111130320112312 (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 (11113032016231) 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, 1040081 + ... + 4827818.
It is an arithmetic number, because the mean of its divisors is an integer number (1391440457250).
Almost surely, 211113032011231 is an apocalyptic number.
11113032011231 is a deficient number, since it is larger than the sum of its proper divisors (18491646769).
11113032011231 is an equidigital number, since it uses as much as digits as its factorization.
11113032011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5871049.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11113032011231 its reverse (13211023031111), we get a palindrome (24324055042342).
The spelling of 11113032011231 in words is "eleven trillion, one hundred thirteen billion, thirty-two million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •