Base | Representation |
---|---|
bin | 11101110010111101100101… |
… | …001001000011111001010001 |
3 | 122011222211012022102020212102 |
4 | 131302331211021003321101 |
5 | 114134022032133323241 |
6 | 1142413240152010145 |
7 | 36413502160353014 |
oct | 3562754511037121 |
9 | 564884168366772 |
10 | 131045444042321 |
11 | 388340738a5796 |
12 | 1284559a090955 |
13 | 58176bc753ba3 |
14 | 24508c1c2137b |
15 | 1023bd571139b |
hex | 772f65243e51 |
131045444042321 has 2 divisors, whose sum is σ = 131045444042322. Its totient is φ = 131045444042320.
The previous prime is 131045444042281. The next prime is 131045444042323. The reversal of 131045444042321 is 123240444540131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95938871035921 + 35106573006400 = 9794839^2 + 5925080^2 .
It is a cyclic number.
It is not a de Polignac number, because 131045444042321 - 230 = 131044370300497 is a prime.
Together with 131045444042323, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (131045444042323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65522722021160 + 65522722021161.
It is an arithmetic number, because the mean of its divisors is an integer number (65522722021161).
Almost surely, 2131045444042321 is an apocalyptic number.
It is an amenable number.
131045444042321 is a deficient number, since it is larger than the sum of its proper divisors (1).
131045444042321 is an equidigital number, since it uses as much as digits as its factorization.
131045444042321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 38.
Adding to 131045444042321 its reverse (123240444540131), we get a palindrome (254285888582452).
The spelling of 131045444042321 in words is "one hundred thirty-one trillion, forty-five billion, four hundred forty-four million, forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •