Base | Representation |
---|---|
bin | 1001010010101111010110… |
… | …00101000101010010100001 |
3 | 2200100120120111021121212201 |
4 | 10221113223011011102201 |
5 | 10134302042432431332 |
6 | 111243431254053201 |
7 | 4206246624653104 |
oct | 451275305052241 |
9 | 80316514247781 |
10 | 20435103405217 |
11 | 656952a148326 |
12 | 236056294a201 |
13 | b530393ac467 |
14 | 5090c856673b |
15 | 25686d4385e7 |
hex | 1295eb1454a1 |
20435103405217 has 2 divisors, whose sum is σ = 20435103405218. Its totient is φ = 20435103405216.
The previous prime is 20435103405133. The next prime is 20435103405263. The reversal of 20435103405217 is 71250430153402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16890653310976 + 3544450094241 = 4109824^2 + 1882671^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20435103405217 is a prime.
It is a super-2 number, since 2×204351034052172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20435103406217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10217551702608 + 10217551702609.
It is an arithmetic number, because the mean of its divisors is an integer number (10217551702609).
Almost surely, 220435103405217 is an apocalyptic number.
It is an amenable number.
20435103405217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20435103405217 is an equidigital number, since it uses as much as digits as its factorization.
20435103405217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 100800, while the sum is 37.
Adding to 20435103405217 its reverse (71250430153402), we get a palindrome (91685533558619).
The spelling of 20435103405217 in words is "twenty trillion, four hundred thirty-five billion, one hundred three million, four hundred five thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •