Base | Representation |
---|---|
bin | 100000011110101111011… |
… | …111001111101101000011 |
3 | 21220101021011102102121012 |
4 | 200132233133033231003 |
5 | 243032200222331321 |
6 | 4425214220551135 |
7 | 320154560630240 |
oct | 40365737175503 |
9 | 7811234372535 |
10 | 2232032230211 |
11 | 790666006713 |
12 | 3006bb0b24ab |
13 | 132630c98b04 |
14 | 7a060c645c7 |
15 | 3d0d86a805b |
hex | 207af7cfb43 |
2232032230211 has 4 divisors (see below), whose sum is σ = 2550893977392. Its totient is φ = 1913170483032.
The previous prime is 2232032230193. The next prime is 2232032230217. The reversal of 2232032230211 is 1120322302322.
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 2232032230211 - 26 = 2232032230147 is a prime.
It is a super-3 number, since 3×22320322302113 (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 not an unprimeable number, because it can be changed into a prime (2232032230217) 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, 159430873580 + ... + 159430873593.
It is an arithmetic number, because the mean of its divisors is an integer number (637723494348).
Almost surely, 22232032230211 is an apocalyptic number.
2232032230211 is a deficient number, since it is larger than the sum of its proper divisors (318861747181).
2232032230211 is an equidigital number, since it uses as much as digits as its factorization.
2232032230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318861747180.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2232032230211 its reverse (1120322302322), we get a palindrome (3352354532533).
The spelling of 2232032230211 in words is "two trillion, two hundred thirty-two billion, thirty-two million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •