Base | Representation |
---|---|
bin | 1010001100100100101101… |
… | …1111111111011110100111 |
3 | 1110200202220000111000112111 |
4 | 2203021023133333132213 |
5 | 2432140344104221411 |
6 | 35502153404301451 |
7 | 2234656166613103 |
oct | 243111337773647 |
9 | 43622800430474 |
10 | 11211131320231 |
11 | 36326833a1817 |
12 | 1310961241887 |
13 | 63428892923b |
14 | 2aa89bb4c903 |
15 | 146961eac721 |
hex | a324b7ff7a7 |
11211131320231 has 8 divisors (see below), whose sum is σ = 11423405096064. Its totient is φ = 10998885062880.
The previous prime is 11211131320199. The next prime is 11211131320247. The reversal of 11211131320231 is 13202313111211.
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 11211131320231 - 25 = 11211131320199 is a prime.
It is a super-2 number, since 2×112111313202312 (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 (11211131329231) 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, 6056176 + ... + 7687621.
It is an arithmetic number, because the mean of its divisors is an integer number (1427925637008).
Almost surely, 211211131320231 is an apocalyptic number.
11211131320231 is a deficient number, since it is larger than the sum of its proper divisors (212273775833).
11211131320231 is a wasteful number, since it uses less digits than its factorization.
11211131320231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13759241.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11211131320231 its reverse (13202313111211), we get a palindrome (24413444431442).
The spelling of 11211131320231 in words is "eleven trillion, two hundred eleven billion, one hundred thirty-one million, three hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •