Base | Representation |
---|---|
bin | 11110101110001101010… |
… | …100111111010111100111 |
3 | 21110211101011022210002100 |
4 | 132232031110333113213 |
5 | 234042214202012411 |
6 | 4253512155343143 |
7 | 305346335116533 |
oct | 36561524772747 |
9 | 7424334283070 |
10 | 2111200032231 |
11 | 74439a419974 |
12 | 2a11b8751ab3 |
13 | 124115567304 |
14 | 7427b1b0bc3 |
15 | 39db561a456 |
hex | 1eb8d53f5e7 |
2111200032231 has 24 divisors (see below), whose sum is σ = 3069057620720. Its totient is φ = 1398449961216.
The previous prime is 2111200032203. The next prime is 2111200032259. The reversal of 2111200032231 is 1322300021112.
2111200032231 is a `hidden beast` number, since 2 + 111 + 200 + 0 + 322 + 31 = 666.
It is an interprime number because it is at equal distance from previous prime (2111200032203) and next prime (2111200032259).
It is not a de Polignac number, because 2111200032231 - 25 = 2111200032199 is a prime.
It is a super-2 number, since 2×21112000322312 (a number of 25 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 (2111200032031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5228865 + ... + 5618133.
Almost surely, 22111200032231 is an apocalyptic number.
2111200032231 is a deficient number, since it is larger than the sum of its proper divisors (957857588489).
2111200032231 is a wasteful number, since it uses less digits than its factorization.
2111200032231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393135 (or 393132 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2111200032231 its reverse (1322300021112), we get a palindrome (3433500053343).
The spelling of 2111200032231 in words is "two trillion, one hundred eleven billion, two hundred million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •