Base | Representation |
---|---|
bin | 100000011110110101011… |
… | …000011010010110011111 |
3 | 21220101112001110122100102 |
4 | 200132311120122112133 |
5 | 243032401030231421 |
6 | 4425232112051315 |
7 | 320160201213431 |
oct | 40366530322637 |
9 | 7811461418312 |
10 | 2232131102111 |
11 | 7907068a7629 |
12 | 300728233b3b |
13 | 132648605cb1 |
14 | 7a070040651 |
15 | 3d0e21d860b |
hex | 207b561a59f |
2232131102111 has 4 divisors (see below), whose sum is σ = 2232616669272. Its totient is φ = 2231645534952.
The previous prime is 2232131102057. The next prime is 2232131102141. The reversal of 2232131102111 is 1112011312322.
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 2232131102111 - 214 = 2232131085727 is a prime.
It is a super-3 number, since 3×22321311021113 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2232131102141) 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, 242776685 + ... + 242785878.
It is an arithmetic number, because the mean of its divisors is an integer number (558154167318).
Almost surely, 22232131102111 is an apocalyptic number.
2232131102111 is a deficient number, since it is larger than the sum of its proper divisors (485567161).
2232131102111 is an equidigital number, since it uses as much as digits as its factorization.
2232131102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485567160.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 2232131102111 its reverse (1112011312322), we get a palindrome (3344142414433).
The spelling of 2232131102111 in words is "two trillion, two hundred thirty-two billion, one hundred thirty-one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •