Base | Representation |
---|---|
bin | 111101000111000001… |
… | …0011011011000110101 |
3 | 110112201210012100100222 |
4 | 1322032002123120311 |
5 | 4122230344120041 |
6 | 140142005344125 |
7 | 12324023523314 |
oct | 1721602333065 |
9 | 415653170328 |
10 | 131232020021 |
11 | 50723065aa3 |
12 | 21525408045 |
13 | c4b51ca56b |
14 | 64ccd7227b |
15 | 36310c674b |
hex | 1e8e09b635 |
131232020021 has 2 divisors, whose sum is σ = 131232020022. Its totient is φ = 131232020020.
The previous prime is 131232020011. The next prime is 131232020027. The reversal of 131232020021 is 120020232131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77634676900 + 53597343121 = 278630^2 + 231511^2 .
It is an emirp because it is prime and its reverse (120020232131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131232020021 - 210 = 131232018997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131232020027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65616010010 + 65616010011.
It is an arithmetic number, because the mean of its divisors is an integer number (65616010011).
Almost surely, 2131232020021 is an apocalyptic number.
It is an amenable number.
131232020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
131232020021 is an equidigital number, since it uses as much as digits as its factorization.
131232020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 131232020021 its reverse (120020232131), we get a palindrome (251252252152).
The spelling of 131232020021 in words is "one hundred thirty-one billion, two hundred thirty-two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •