Base | Representation |
---|---|
bin | 10010110000000111… |
… | …101000111100110101 |
3 | 1220222012220210201001 |
4 | 102300013220330311 |
5 | 312213433140231 |
6 | 13125535403301 |
7 | 1311645542212 |
oct | 226007507465 |
9 | 56865823631 |
10 | 20134661941 |
11 | 85a2545589 |
12 | 3a9b083531 |
13 | 1b8b566364 |
14 | d9013ab09 |
15 | 7cc9bab61 |
hex | 4b01e8f35 |
20134661941 has 2 divisors, whose sum is σ = 20134661942. Its totient is φ = 20134661940.
The previous prime is 20134661873. The next prime is 20134662029. The reversal of 20134661941 is 14916643102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19957212900 + 177449041 = 141270^2 + 13321^2 .
It is a cyclic number.
It is not a de Polignac number, because 20134661941 - 233 = 11544727349 is a prime.
It is a super-2 number, since 2×201346619412 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20134661941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20134661641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10067330970 + 10067330971.
It is an arithmetic number, because the mean of its divisors is an integer number (10067330971).
Almost surely, 220134661941 is an apocalyptic number.
It is an amenable number.
20134661941 is a deficient number, since it is larger than the sum of its proper divisors (1).
20134661941 is an equidigital number, since it uses as much as digits as its factorization.
20134661941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 20134661941 in words is "twenty billion, one hundred thirty-four million, six hundred sixty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •