Base | Representation |
---|---|
bin | 11101110010010011101000… |
… | …111010101111010000101011 |
3 | 122011211111221211101001210112 |
4 | 131302103220322233100223 |
5 | 114132302320010140133 |
6 | 1142340431353204535 |
7 | 36410316200351561 |
oct | 3562235072572053 |
9 | 564744854331715 |
10 | 131000410240043 |
11 | 38816a64452583 |
12 | 1283891040074b |
13 | 58133938391c6 |
14 | 244c64ccb3a31 |
15 | 102294bd47648 |
hex | 7724e8eaf42b |
131000410240043 has 2 divisors, whose sum is σ = 131000410240044. Its totient is φ = 131000410240042.
The previous prime is 131000410240003. The next prime is 131000410240067. The reversal of 131000410240043 is 340042014000131.
It is a strong prime.
It is an emirp because it is prime and its reverse (340042014000131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131000410240043 is a prime.
It is a super-3 number, since 3×1310004102400433 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (131000410240003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500205120021 + 65500205120022.
It is an arithmetic number, because the mean of its divisors is an integer number (65500205120022).
Almost surely, 2131000410240043 is an apocalyptic number.
131000410240043 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000410240043 is an equidigital number, since it uses as much as digits as its factorization.
131000410240043 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 131000410240043 its reverse (340042014000131), we get a palindrome (471042424240174).
The spelling of 131000410240043 in words is "one hundred thirty-one trillion, four hundred ten million, two hundred forty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •