Base | Representation |
---|---|
bin | 11001111110010010010011… |
… | …111101010010101010101011 |
3 | 112222110102021221100202020100 |
4 | 121332102103331102222223 |
5 | 104433031433211204121 |
6 | 1042541110132000443 |
7 | 33026643246514011 |
oct | 3176222375225253 |
9 | 488412257322210 |
10 | 114231432522411 |
11 | 33441307719306 |
12 | 1098a997760123 |
13 | 4b97c934a8a39 |
14 | 202cb8bb468b1 |
15 | d3164d3d7026 |
hex | 67e493f52aab |
114231432522411 has 6 divisors (see below), whose sum is σ = 165000958087940. Its totient is φ = 76154288348268.
The previous prime is 114231432522407. The next prime is 114231432522421. The reversal of 114231432522411 is 114225234132411.
114231432522411 is a `hidden beast` number, since 1 + 1 + 4 + 2 + 314 + 325 + 2 + 2 + 4 + 11 = 666.
It is not a de Polignac number, because 114231432522411 - 22 = 114231432522407 is a prime.
It is a super-2 number, since 2×1142314325224112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114231432522421) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6346190695681 + ... + 6346190695698.
Almost surely, 2114231432522411 is an apocalyptic number.
114231432522411 is a deficient number, since it is larger than the sum of its proper divisors (50769525565529).
114231432522411 is a wasteful number, since it uses less digits than its factorization.
114231432522411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12692381391385 (or 12692381391382 counting only the distinct ones).
The product of its digits is 46080, while the sum is 36.
Adding to 114231432522411 its reverse (114225234132411), we get a palindrome (228456666654822).
The spelling of 114231432522411 in words is "one hundred fourteen trillion, two hundred thirty-one billion, four hundred thirty-two million, five hundred twenty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •