Base | Representation |
---|---|
bin | 1001011001011010110110… |
… | …11110000010100010101011 |
3 | 2201011112000001111121221111 |
4 | 10230231123132002202223 |
5 | 10202032121244344233 |
6 | 111541110231451151 |
7 | 4231653414031255 |
oct | 454553336024253 |
9 | 81145001447844 |
10 | 20664622262443 |
11 | 66478a95a58a5 |
12 | 2398b38226ab7 |
13 | b6b8861b1853 |
14 | 51625cc08cd5 |
15 | 25c803145acd |
hex | 12cb5b7828ab |
20664622262443 has 4 divisors (see below), whose sum is σ = 20700812494648. Its totient is φ = 20628432030240.
The previous prime is 20664622262419. The next prime is 20664622262489. The reversal of 20664622262443 is 34426222646602.
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 20664622262443 - 29 = 20664622261931 is a prime.
It is a super-2 number, since 2×206646222624432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20664622262413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18095115246 + ... + 18095116387.
It is an arithmetic number, because the mean of its divisors is an integer number (5175203123662).
Almost surely, 220664622262443 is an apocalyptic number.
20664622262443 is a deficient number, since it is larger than the sum of its proper divisors (36190232205).
20664622262443 is an equidigital number, since it uses as much as digits as its factorization.
20664622262443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36190232204.
The product of its (nonzero) digits is 7962624, while the sum is 49.
The spelling of 20664622262443 in words is "twenty trillion, six hundred sixty-four billion, six hundred twenty-two million, two hundred sixty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •