Base | Representation |
---|---|
bin | 1001000110111111011100… |
… | …10010011100000100110001 |
3 | 2121220222121211010210120022 |
4 | 10203133232102130010301 |
5 | 10111143332124442431 |
6 | 110334151222453225 |
7 | 4135136342202155 |
oct | 443375622340461 |
9 | 77828554123508 |
10 | 20031430312241 |
11 | 64233112138a7 |
12 | 22b6285594215 |
13 | b23c56aab72a |
14 | 4d3752629065 |
15 | 24b0e434107b |
hex | 1237ee49c131 |
20031430312241 has 2 divisors, whose sum is σ = 20031430312242. Its totient is φ = 20031430312240.
The previous prime is 20031430312183. The next prime is 20031430312249. The reversal of 20031430312241 is 14221303413002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13376604019216 + 6654826293025 = 3657404^2 + 2579695^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20031430312241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20031430312241.
It is not a weakly prime, because it can be changed into another prime (20031430312249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10015715156120 + 10015715156121.
It is an arithmetic number, because the mean of its divisors is an integer number (10015715156121).
Almost surely, 220031430312241 is an apocalyptic number.
It is an amenable number.
20031430312241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20031430312241 is an equidigital number, since it uses as much as digits as its factorization.
20031430312241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 20031430312241 its reverse (14221303413002), we get a palindrome (34252733725243).
The spelling of 20031430312241 in words is "twenty trillion, thirty-one billion, four hundred thirty million, three hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •