Base | Representation |
---|---|
bin | 11001111111101111011100… |
… | …010110110110111100110101 |
3 | 112222210222102000221200201001 |
4 | 121333233130112312330311 |
5 | 104441201232421310424 |
6 | 1043055045015403301 |
7 | 33040113311311312 |
oct | 3177573426667465 |
9 | 488728360850631 |
10 | 114331431431989 |
11 | 3347a76247a132 |
12 | 109a6245083531 |
13 | 4ba453b9c6055 |
14 | 20339569a1d09 |
15 | d340524a8844 |
hex | 67fbdc5b6f35 |
114331431431989 has 2 divisors, whose sum is σ = 114331431431990. Its totient is φ = 114331431431988.
The previous prime is 114331431431957. The next prime is 114331431431999. The reversal of 114331431431989 is 989134134133411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83361738970225 + 30969692461764 = 9130265^2 + 5565042^2 .
It is a cyclic number.
It is not a de Polignac number, because 114331431431989 - 25 = 114331431431957 is a prime.
It is a super-2 number, since 2×1143314314319892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114331431431929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57165715715994 + 57165715715995.
It is an arithmetic number, because the mean of its divisors is an integer number (57165715715995).
Almost surely, 2114331431431989 is an apocalyptic number.
It is an amenable number.
114331431431989 is a deficient number, since it is larger than the sum of its proper divisors (1).
114331431431989 is an equidigital number, since it uses as much as digits as its factorization.
114331431431989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3359232, while the sum is 55.
The spelling of 114331431431989 in words is "one hundred fourteen trillion, three hundred thirty-one billion, four hundred thirty-one million, four hundred thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •