Base | Representation |
---|---|
bin | 1001100111000000010110… |
… | …11100111011111100001001 |
3 | 2202211010220202221020221002 |
4 | 10303200023130323330021 |
5 | 10232204132343344431 |
6 | 112535351232024345 |
7 | 4310460364555052 |
oct | 463401334737411 |
9 | 82733822836832 |
10 | 21131431231241 |
11 | 68078760422a1 |
12 | 24534b56920b5 |
13 | ba38bab19096 |
14 | 530aa3c91729 |
15 | 269a24e243cb |
hex | 13380b73bf09 |
21131431231241 has 2 divisors, whose sum is σ = 21131431231242. Its totient is φ = 21131431231240.
The previous prime is 21131431231201. The next prime is 21131431231279. The reversal of 21131431231241 is 14213213413112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10813870518025 + 10317560713216 = 3288445^2 + 3212096^2 .
It is a cyclic number.
It is not a de Polignac number, because 21131431231241 - 218 = 21131430969097 is a prime.
It is not a weakly prime, because it can be changed into another prime (21131431231201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10565715615620 + 10565715615621.
It is an arithmetic number, because the mean of its divisors is an integer number (10565715615621).
Almost surely, 221131431231241 is an apocalyptic number.
It is an amenable number.
21131431231241 is a deficient number, since it is larger than the sum of its proper divisors (1).
21131431231241 is an equidigital number, since it uses as much as digits as its factorization.
21131431231241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 21131431231241 its reverse (14213213413112), we get a palindrome (35344644644353).
The spelling of 21131431231241 in words is "twenty-one trillion, one hundred thirty-one billion, four hundred thirty-one million, two hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •