Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …0100011110110101100111 |
3 | 1120212210212101112120102222 |
4 | 2300033111310132311213 |
5 | 3041412013112042411 |
6 | 41431432415022555 |
7 | 2356666231254161 |
oct | 260172564366547 |
9 | 46783771476388 |
10 | 12111100112231 |
11 | 394a31a30657a |
12 | 1437266b0aa5b |
13 | 69b0c1aa9573 |
14 | 2dc274d2d931 |
15 | 1600868c24db |
hex | b03d5d1ed67 |
12111100112231 has 8 divisors (see below), whose sum is σ = 12682325765760. Its totient is φ = 11543595799032.
The previous prime is 12111100112207. The next prime is 12111100112297. The reversal of 12111100112231 is 13221100111121.
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 12111100112231 - 210 = 12111100111207 is a prime.
It is a super-2 number, since 2×121111001122312 (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 (12111100112431) 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, 930328421 + ... + 930341438.
It is an arithmetic number, because the mean of its divisors is an integer number (1585290720720).
Almost surely, 212111100112231 is an apocalyptic number.
12111100112231 is a deficient number, since it is larger than the sum of its proper divisors (571225653529).
12111100112231 is a wasteful number, since it uses less digits than its factorization.
12111100112231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1860670165.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 12111100112231 its reverse (13221100111121), we get a palindrome (25332200223352).
The spelling of 12111100112231 in words is "twelve trillion, one hundred eleven billion, one hundred million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •