Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …000011001111010010011111 |
3 | 122011211120201220220111001211 |
4 | 131302110102003033102133 |
5 | 114132310223141143424 |
6 | 1142341024044245251 |
7 | 36410342250145162 |
oct | 3562242203172237 |
9 | 564746656814054 |
10 | 131001100334239 |
11 | 38817288a46563 |
12 | 12838a83540827 |
13 | 58134737ba875 |
14 | 244c6b67cdad9 |
15 | 102298c70eb94 |
hex | 7725120cf49f |
131001100334239 has 2 divisors, whose sum is σ = 131001100334240. Its totient is φ = 131001100334238.
The previous prime is 131001100334219. The next prime is 131001100334309. The reversal of 131001100334239 is 932433001100131.
It is a weak prime.
It is an emirp because it is prime and its reverse (932433001100131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131001100334239 - 227 = 131000966116511 is a prime.
It is a super-2 number, since 2×1310011003342392 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131001100334239.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131001100334219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500550167119 + 65500550167120.
It is an arithmetic number, because the mean of its divisors is an integer number (65500550167120).
Almost surely, 2131001100334239 is an apocalyptic number.
131001100334239 is a deficient number, since it is larger than the sum of its proper divisors (1).
131001100334239 is an equidigital number, since it uses as much as digits as its factorization.
131001100334239 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 131001100334239 in words is "one hundred thirty-one trillion, one billion, one hundred million, three hundred thirty-four thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •