Base | Representation |
---|---|
bin | 11101110100100000111011… |
… | …101001101010110100110001 |
3 | 122012101000112220001120211012 |
4 | 131310200323221222310301 |
5 | 114142244021231122323 |
6 | 1142534241513400305 |
7 | 36424266564215036 |
oct | 3564407351526461 |
9 | 565330486046735 |
10 | 131152122129713 |
11 | 388753368a4783 |
12 | 128621b0409095 |
13 | 5824790968919 |
14 | 2455b21b6338d |
15 | 102687ad78678 |
hex | 77483ba6ad31 |
131152122129713 has 2 divisors, whose sum is σ = 131152122129714. Its totient is φ = 131152122129712.
The previous prime is 131152122129683. The next prime is 131152122129757. The reversal of 131152122129713 is 317921221251131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130049573829184 + 1102548300529 = 11403928^2 + 1050023^2 .
It is a cyclic number.
It is not a de Polignac number, because 131152122129713 - 226 = 131152055020849 is a prime.
It is not a weakly prime, because it can be changed into another prime (131152122129113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65576061064856 + 65576061064857.
It is an arithmetic number, because the mean of its divisors is an integer number (65576061064857).
Almost surely, 2131152122129713 is an apocalyptic number.
It is an amenable number.
131152122129713 is a deficient number, since it is larger than the sum of its proper divisors (1).
131152122129713 is an equidigital number, since it uses as much as digits as its factorization.
131152122129713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45360, while the sum is 41.
The spelling of 131152122129713 in words is "one hundred thirty-one trillion, one hundred fifty-two billion, one hundred twenty-two million, one hundred twenty-nine thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •