Base | Representation |
---|---|
bin | 1001001010000001100010… |
… | …11000011010000000111001 |
3 | 2122021221121000221210202022 |
4 | 10211000301120122000321 |
5 | 10114400240100241431 |
6 | 110454103314244225 |
7 | 4145515544633261 |
oct | 445006130320071 |
9 | 78257530853668 |
10 | 20135635165241 |
11 | 6463525130222 |
12 | 2312507586675 |
13 | b30a227a5a6b |
14 | 4d87d9cc67a1 |
15 | 24db927b807b |
hex | 12503161a039 |
20135635165241 has 2 divisors, whose sum is σ = 20135635165242. Its totient is φ = 20135635165240.
The previous prime is 20135635165211. The next prime is 20135635165253. The reversal of 20135635165241 is 14256153653102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19197892771600 + 937742393641 = 4381540^2 + 968371^2 .
It is a cyclic number.
It is not a de Polignac number, because 20135635165241 - 234 = 20118455296057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20135635165192 and 20135635165201.
It is not a weakly prime, because it can be changed into another prime (20135635165211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10067817582620 + 10067817582621.
It is an arithmetic number, because the mean of its divisors is an integer number (10067817582621).
Almost surely, 220135635165241 is an apocalyptic number.
It is an amenable number.
20135635165241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20135635165241 is an equidigital number, since it uses as much as digits as its factorization.
20135635165241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648000, while the sum is 44.
The spelling of 20135635165241 in words is "twenty trillion, one hundred thirty-five billion, six hundred thirty-five million, one hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •