Base | Representation |
---|---|
bin | 1110001001101010111… |
… | …0010100111000111111 |
3 | 212020112000220000110112 |
4 | 3202122232110320333 |
5 | 12440344141112111 |
6 | 303403544500235 |
7 | 23364406636523 |
oct | 3423256247077 |
9 | 766460800415 |
10 | 243114004031 |
11 | 94116576598 |
12 | 3b14a47a67b |
13 | 19c05590972 |
14 | baa408dd83 |
15 | 64cd51de8b |
hex | 389ab94e3f |
243114004031 has 2 divisors, whose sum is σ = 243114004032. Its totient is φ = 243114004030.
The previous prime is 243114004013. The next prime is 243114004127. The reversal of 243114004031 is 130400411342.
Together with previous prime (243114004013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 243114004031 - 222 = 243109809727 is a prime.
It is a super-3 number, since 3×2431140040313 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 243114003988 and 243114004006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243114003031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121557002015 + 121557002016.
It is an arithmetic number, because the mean of its divisors is an integer number (121557002016).
Almost surely, 2243114004031 is an apocalyptic number.
243114004031 is a deficient number, since it is larger than the sum of its proper divisors (1).
243114004031 is an equidigital number, since it uses as much as digits as its factorization.
243114004031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 243114004031 its reverse (130400411342), we get a palindrome (373514415373).
The spelling of 243114004031 in words is "two hundred forty-three billion, one hundred fourteen million, four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •