Base | Representation |
---|---|
bin | 1010000111010100111101… |
… | …1000101110111101101111 |
3 | 1110101011020202122222220102 |
4 | 2201311033120232331233 |
5 | 2424201303031310411 |
6 | 35352530132541315 |
7 | 2225315542055231 |
oct | 241651730567557 |
9 | 43334222588812 |
10 | 11121002213231 |
11 | 35a8432909729 |
12 | 12b73a918183b |
13 | 628924141ab1 |
14 | 2a638ba44251 |
15 | 14443962bd3b |
hex | a1d4f62ef6f |
11121002213231 has 4 divisors (see below), whose sum is σ = 11504485048200. Its totient is φ = 10737519378264.
The previous prime is 11121002213207. The next prime is 11121002213309. The reversal of 11121002213231 is 13231220012111.
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 11121002213231 - 234 = 11103822344047 is a prime.
It is a super-2 number, since 2×111210022132312 (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 (11121002213831) 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, 191741417441 + ... + 191741417498.
It is an arithmetic number, because the mean of its divisors is an integer number (2876121262050).
Almost surely, 211121002213231 is an apocalyptic number.
11121002213231 is a deficient number, since it is larger than the sum of its proper divisors (383482834969).
11121002213231 is an equidigital number, since it uses as much as digits as its factorization.
11121002213231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383482834968.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11121002213231 its reverse (13231220012111), we get a palindrome (24352222225342).
The spelling of 11121002213231 in words is "eleven trillion, one hundred twenty-one billion, two million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •