Base | Representation |
---|---|
bin | 11101110101110100110100… |
… | …101101100011100000010101 |
3 | 122012200122001120111120201111 |
4 | 131311310310231203200111 |
5 | 114200233011201133023 |
6 | 1143043500115255021 |
7 | 36433636030522654 |
oct | 3565646455434025 |
9 | 565618046446644 |
10 | 131242200021013 |
11 | 388aa560486744 |
12 | 1287774b2aa471 |
13 | 5830117960513 |
14 | 245a22913919b |
15 | 1028d9de8e00d |
hex | 775d34b63815 |
131242200021013 has 2 divisors, whose sum is σ = 131242200021014. Its totient is φ = 131242200021012.
The previous prime is 131242200020947. The next prime is 131242200021061. The reversal of 131242200021013 is 310120002242131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129321087595249 + 1921112425764 = 11371943^2 + 1386042^2 .
It is an emirp because it is prime and its reverse (310120002242131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131242200021013 - 225 = 131242166466581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131242200021073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65621100010506 + 65621100010507.
It is an arithmetic number, because the mean of its divisors is an integer number (65621100010507).
Almost surely, 2131242200021013 is an apocalyptic number.
It is an amenable number.
131242200021013 is a deficient number, since it is larger than the sum of its proper divisors (1).
131242200021013 is an equidigital number, since it uses as much as digits as its factorization.
131242200021013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 131242200021013 its reverse (310120002242131), we get a palindrome (441362202263144).
The spelling of 131242200021013 in words is "one hundred thirty-one trillion, two hundred forty-two billion, two hundred million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •