Base | Representation |
---|---|
bin | 1001100110111111110001… |
… | …11110100101011010000001 |
3 | 2202211010010011201100020221 |
4 | 10303133320332211122001 |
5 | 10232203014022102422 |
6 | 112535300400503041 |
7 | 4310446612220662 |
oct | 463377076453201 |
9 | 82733104640227 |
10 | 21131121284737 |
11 | 6807727094962 |
12 | 245342991aa81 |
13 | ba386b847b99 |
14 | 530a74a4d369 |
15 | 269a07aed3c7 |
hex | 1337f8fa5681 |
21131121284737 has 2 divisors, whose sum is σ = 21131121284738. Its totient is φ = 21131121284736.
The previous prime is 21131121284699. The next prime is 21131121284803. The reversal of 21131121284737 is 73748212113112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20272902471936 + 858218812801 = 4502544^2 + 926401^2 .
It is a cyclic number.
It is not a de Polignac number, because 21131121284737 - 239 = 20581365470849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21131121284693 and 21131121284702.
It is not a weakly prime, because it can be changed into another prime (21131121284437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10565560642368 + 10565560642369.
It is an arithmetic number, because the mean of its divisors is an integer number (10565560642369).
Almost surely, 221131121284737 is an apocalyptic number.
It is an amenable number.
21131121284737 is a deficient number, since it is larger than the sum of its proper divisors (1).
21131121284737 is an equidigital number, since it uses as much as digits as its factorization.
21131121284737 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 112896, while the sum is 43.
Adding to 21131121284737 its reverse (73748212113112), we get a palindrome (94879333397849).
The spelling of 21131121284737 in words is "twenty-one trillion, one hundred thirty-one billion, one hundred twenty-one million, two hundred eighty-four thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •