Base | Representation |
---|---|
bin | 11101110010010011010000… |
… | …101101001101010111001101 |
3 | 122011211110220112000222021201 |
4 | 131302103100231031113031 |
5 | 114132301002013241031 |
6 | 1142340323203025501 |
7 | 36410303135615365 |
oct | 3562232055152715 |
9 | 564743815028251 |
10 | 131000004040141 |
11 | 38816876132585 |
12 | 1283881836b291 |
13 | 581332a636932 |
14 | 244c610d779a5 |
15 | 102292635bd61 |
hex | 7724d0b4d5cd |
131000004040141 has 2 divisors, whose sum is σ = 131000004040142. Its totient is φ = 131000004040140.
The previous prime is 131000004040091. The next prime is 131000004040223. The reversal of 131000004040141 is 141040400000131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123169577116041 + 7830426924100 = 11098179^2 + 2798290^2 .
It is a cyclic number.
It is not a de Polignac number, because 131000004040141 - 29 = 131000004039629 is a prime.
It is a super-2 number, since 2×1310000040401412 (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 (131000004040441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500002020070 + 65500002020071.
It is an arithmetic number, because the mean of its divisors is an integer number (65500002020071).
Almost surely, 2131000004040141 is an apocalyptic number.
It is an amenable number.
131000004040141 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000004040141 is an equidigital number, since it uses as much as digits as its factorization.
131000004040141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 131000004040141 its reverse (141040400000131), we get a palindrome (272040404040272).
The spelling of 131000004040141 in words is "one hundred thirty-one trillion, four million, forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •