Base | Representation |
---|---|
bin | 1001011100001100110101… |
… | …11000000100101100010001 |
3 | 2201111122122022110111120212 |
4 | 10232012122320010230101 |
5 | 10210113314341111423 |
6 | 112053032021413505 |
7 | 4241605332520310 |
oct | 456063270045421 |
9 | 81448568414525 |
10 | 20760175332113 |
11 | 6684382838368 |
12 | 23b356486a295 |
13 | b778a3609169 |
14 | 51ab25416277 |
15 | 260046c76578 |
hex | 12e19ae04b11 |
20760175332113 has 4 divisors (see below), whose sum is σ = 23725914665280. Its totient is φ = 17794435998948.
The previous prime is 20760175332079. The next prime is 20760175332139. The reversal of 20760175332113 is 31123357106702.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20760175332113 - 216 = 20760175266577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20760175332163) 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, 1482869666573 + ... + 1482869666586.
It is an arithmetic number, because the mean of its divisors is an integer number (5931478666320).
Almost surely, 220760175332113 is an apocalyptic number.
It is an amenable number.
20760175332113 is a deficient number, since it is larger than the sum of its proper divisors (2965739333167).
20760175332113 is an equidigital number, since it uses as much as digits as its factorization.
20760175332113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2965739333166.
The product of its (nonzero) digits is 158760, while the sum is 41.
The spelling of 20760175332113 in words is "twenty trillion, seven hundred sixty billion, one hundred seventy-five million, three hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •