Base | Representation |
---|---|
bin | 1001100000010110001111… |
… | …01010010101100000001011 |
3 | 2202000021102100200102020012 |
4 | 10300023013222111200023 |
5 | 10214432122110021233 |
6 | 112242314424022135 |
7 | 4255111262526551 |
oct | 460130752254013 |
9 | 82007370612205 |
10 | 20902660626443 |
11 | 672984aaa0962 |
12 | 24170aa90194b |
13 | b8816004bbcb |
14 | 5239a0b47bd1 |
15 | 263ad5c6b548 |
hex | 1302c7a9580b |
20902660626443 has 4 divisors (see below), whose sum is σ = 20902694558760. Its totient is φ = 20902626694128.
The previous prime is 20902660626403. The next prime is 20902660626511. The reversal of 20902660626443 is 34462606620902.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20902660626443 - 226 = 20902593517579 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20902660626391 and 20902660626400.
It is not an unprimeable number, because it can be changed into a prime (20902660626403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16024730 + ... + 17279967.
It is an arithmetic number, because the mean of its divisors is an integer number (5225673639690).
Almost surely, 220902660626443 is an apocalyptic number.
20902660626443 is a deficient number, since it is larger than the sum of its proper divisors (33932317).
20902660626443 is an equidigital number, since it uses as much as digits as its factorization.
20902660626443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33932316.
The product of its (nonzero) digits is 4478976, while the sum is 50.
The spelling of 20902660626443 in words is "twenty trillion, nine hundred two billion, six hundred sixty million, six hundred twenty-six thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •