Base | Representation |
---|---|
bin | 11101110010011110011011… |
… | …110010110000001101001101 |
3 | 122011212121212121210222211122 |
4 | 131302132123302300031031 |
5 | 114133000034301444041 |
6 | 1142350025451530325 |
7 | 36411206344044551 |
oct | 3562363362601515 |
9 | 564777777728748 |
10 | 131012001203021 |
11 | 38820972226624 |
12 | 1283b0061599a5 |
13 | 58144c0016c93 |
14 | 244d02c457861 |
15 | 1022dc971bc4b |
hex | 77279bcb034d |
131012001203021 has 2 divisors, whose sum is σ = 131012001203022. Its totient is φ = 131012001203020.
The previous prime is 131012001202987. The next prime is 131012001203029. The reversal of 131012001203021 is 120302100210131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129609231006025 + 1402770196996 = 11384605^2 + 1184386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131012001203021 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131012001203029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65506000601510 + 65506000601511.
It is an arithmetic number, because the mean of its divisors is an integer number (65506000601511).
Almost surely, 2131012001203021 is an apocalyptic number.
It is an amenable number.
131012001203021 is a deficient number, since it is larger than the sum of its proper divisors (1).
131012001203021 is an equidigital number, since it uses as much as digits as its factorization.
131012001203021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 131012001203021 its reverse (120302100210131), we get a palindrome (251314101413152).
The spelling of 131012001203021 in words is "one hundred thirty-one trillion, twelve billion, one million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •