Base | Representation |
---|---|
bin | 10011001100000000… |
… | …101110100001010101 |
3 | 1222011211110010020012 |
4 | 103030000232201111 |
5 | 314143232034142 |
6 | 13244213250005 |
7 | 1326360211415 |
oct | 231400564125 |
9 | 58154403205 |
10 | 20602611797 |
11 | 88127011a9 |
12 | 3bab933905 |
13 | 1c344a9271 |
14 | dd634c645 |
15 | 808b02882 |
hex | 4cc02e855 |
20602611797 has 4 divisors (see below), whose sum is σ = 21814530156. Its totient is φ = 19390693440.
The previous prime is 20602611793. The next prime is 20602611803. The reversal of 20602611797 is 79711620602.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79711620602 = 2 ⋅39855810301.
It can be written as a sum of positive squares in 2 ways, for example, as 18541996561 + 2060615236 = 136169^2 + 45394^2 .
It is a cyclic number.
It is not a de Polignac number, because 20602611797 - 22 = 20602611793 is a prime.
It is a super-2 number, since 2×206026117972 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20602611793) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 605959154 + ... + 605959187.
It is an arithmetic number, because the mean of its divisors is an integer number (5453632539).
Almost surely, 220602611797 is an apocalyptic number.
It is an amenable number.
20602611797 is a deficient number, since it is larger than the sum of its proper divisors (1211918359).
20602611797 is a wasteful number, since it uses less digits than its factorization.
20602611797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1211918358.
The product of its (nonzero) digits is 63504, while the sum is 41.
The spelling of 20602611797 in words is "twenty billion, six hundred two million, six hundred eleven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •