Base | Representation |
---|---|
bin | 11001111010111010110001… |
… | …110011110111001110101111 |
3 | 112221122021221100220021111220 |
4 | 121322322301303313032233 |
5 | 104420234002303230411 |
6 | 1042242513535514423 |
7 | 33004141254252450 |
oct | 3172726163671657 |
9 | 487567840807456 |
10 | 114000005133231 |
11 | 33362148a184a8 |
12 | 10951b6b088a13 |
13 | 4b7c2011764b9 |
14 | 20218b5c19127 |
15 | d2a605d83b06 |
hex | 67aeb1cf73af |
114000005133231 has 16 divisors (see below), whose sum is σ = 174151861039104. Its totient is φ = 64978772262624.
The previous prime is 114000005133227. The next prime is 114000005133241. The reversal of 114000005133231 is 132331500000411.
It is not a de Polignac number, because 114000005133231 - 22 = 114000005133227 is a prime.
It is a super-2 number, since 2×1140000051332312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114000005133241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6836983695 + ... + 6837000368.
It is an arithmetic number, because the mean of its divisors is an integer number (10884491314944).
Almost surely, 2114000005133231 is an apocalyptic number.
114000005133231 is a deficient number, since it is larger than the sum of its proper divisors (60151855905873).
114000005133231 is a wasteful number, since it uses less digits than its factorization.
114000005133231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13673984470.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 114000005133231 its reverse (132331500000411), we get a palindrome (246331505133642).
The spelling of 114000005133231 in words is "one hundred fourteen trillion, five million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •