Base | Representation |
---|---|
bin | 11101110010010011010010… |
… | …111111100010110011101001 |
3 | 122011211111000012012220111022 |
4 | 131302103102333202303221 |
5 | 114132301041323313001 |
6 | 1142340331053142225 |
7 | 36410304112645544 |
oct | 3562232277426351 |
9 | 564744005186438 |
10 | 131000042401001 |
11 | 38816895853674 |
12 | 1283882918a975 |
13 | 5813335578377 |
14 | 244c6160c185b |
15 | 10229298d811b |
hex | 7724d2fe2ce9 |
131000042401001 has 2 divisors, whose sum is σ = 131000042401002. Its totient is φ = 131000042401000.
The previous prime is 131000042400979. The next prime is 131000042401021. The reversal of 131000042401001 is 100104240000131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79166378207401 + 51833664193600 = 8897549^2 + 7199560^2 .
It is a cyclic number.
It is not a de Polignac number, because 131000042401001 - 218 = 131000042138857 is a prime.
It is a super-2 number, since 2×1310000424010012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131000042401021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500021200500 + 65500021200501.
It is an arithmetic number, because the mean of its divisors is an integer number (65500021200501).
Almost surely, 2131000042401001 is an apocalyptic number.
It is an amenable number.
131000042401001 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000042401001 is an equidigital number, since it uses as much as digits as its factorization.
131000042401001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 131000042401001 its reverse (100104240000131), we get a palindrome (231104282401132).
The spelling of 131000042401001 in words is "one hundred thirty-one trillion, forty-two million, four hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •