Base | Representation |
---|---|
bin | 10011010000101011… |
… | …111010110010011101 |
3 | 1222101022000211202022 |
4 | 103100223322302131 |
5 | 314323321334401 |
6 | 13300054305525 |
7 | 1331331652205 |
oct | 232053726235 |
9 | 58338024668 |
10 | 20681043101 |
11 | 8852a00864 |
12 | 40120582a5 |
13 | 1c4780a614 |
14 | 1002927405 |
15 | 81094671b |
hex | 4d0afac9d |
20681043101 has 4 divisors (see below), whose sum is σ = 21580218912. Its totient is φ = 19781867292.
The previous prime is 20681043059. The next prime is 20681043109. The reversal of 20681043101 is 10134018602.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10134018602 = 2 ⋅5067009301.
It is a cyclic number.
It is not a de Polignac number, because 20681043101 - 218 = 20680780957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20681043109) 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, 449587871 + ... + 449587916.
It is an arithmetic number, because the mean of its divisors is an integer number (5395054728).
Almost surely, 220681043101 is an apocalyptic number.
It is an amenable number.
20681043101 is a deficient number, since it is larger than the sum of its proper divisors (899175811).
20681043101 is an equidigital number, since it uses as much as digits as its factorization.
20681043101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899175810.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 20681043101 in words is "twenty billion, six hundred eighty-one million, forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •