Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0101010111110111101 |
3 | 110112012201111111122101 |
4 | 1322002000222332331 |
5 | 4121322214424041 |
6 | 140110000345101 |
7 | 12316023414112 |
oct | 1720200527675 |
9 | 415181444571 |
10 | 131030233021 |
11 | 5062a172486 |
12 | 21489915191 |
13 | c482468a7c |
14 | 64b0246909 |
15 | 361d517b31 |
hex | 1e8202afbd |
131030233021 has 2 divisors, whose sum is σ = 131030233022. Its totient is φ = 131030233020.
The previous prime is 131030232923. The next prime is 131030233049. The reversal of 131030233021 is 120332030131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71108088921 + 59922144100 = 266661^2 + 244790^2 .
It is a cyclic number.
It is not a de Polignac number, because 131030233021 - 211 = 131030230973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131030233021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131030233421) 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, 65515116510 + 65515116511.
It is an arithmetic number, because the mean of its divisors is an integer number (65515116511).
Almost surely, 2131030233021 is an apocalyptic number.
It is an amenable number.
131030233021 is a deficient number, since it is larger than the sum of its proper divisors (1).
131030233021 is an equidigital number, since it uses as much as digits as its factorization.
131030233021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 131030233021 its reverse (120332030131), we get a palindrome (251362263152).
The spelling of 131030233021 in words is "one hundred thirty-one billion, thirty million, two hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •