Base | Representation |
---|---|
bin | 1001010010101110000110… |
… | …01100010001011010000001 |
3 | 2200100111211212001112120101 |
4 | 10221113003030101122001 |
5 | 10134244210123414332 |
6 | 111243241030442401 |
7 | 4206224220554041 |
oct | 451270314213201 |
9 | 80314755045511 |
10 | 20434434201217 |
11 | 6569216422473 |
12 | 23603b6803401 |
13 | b52c6086346a |
14 | 509063727721 |
15 | 25682e7eaae7 |
hex | 1295c3311681 |
20434434201217 has 2 divisors, whose sum is σ = 20434434201218. Its totient is φ = 20434434201216.
The previous prime is 20434434201191. The next prime is 20434434201227. The reversal of 20434434201217 is 71210243443402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19590679890496 + 843754310721 = 4426136^2 + 918561^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20434434201217 is a prime.
It is a super-2 number, since 2×204344342012172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20434434201227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10217217100608 + 10217217100609.
It is an arithmetic number, because the mean of its divisors is an integer number (10217217100609).
Almost surely, 220434434201217 is an apocalyptic number.
It is an amenable number.
20434434201217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20434434201217 is an equidigital number, since it uses as much as digits as its factorization.
20434434201217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129024, while the sum is 37.
Adding to 20434434201217 its reverse (71210243443402), we get a palindrome (91644677644619).
The spelling of 20434434201217 in words is "twenty trillion, four hundred thirty-four billion, four hundred thirty-four million, two hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •