Base | Representation |
---|---|
bin | 1001001011001010010100… |
… | …11110111111101110101001 |
3 | 2122102200110022002100011121 |
4 | 10211211022132333232221 |
5 | 10121020302010404044 |
6 | 110524045001455241 |
7 | 4151401101200302 |
oct | 445451236775651 |
9 | 78380408070147 |
10 | 20174711028649 |
11 | 6479057470811 |
12 | 2319bb1aa1521 |
13 | b3460c260728 |
14 | 4da6658537a9 |
15 | 24ebcd0a6984 |
hex | 12594a7bfba9 |
20174711028649 has 4 divisors (see below), whose sum is σ = 20174772945040. Its totient is φ = 20174649112260.
The previous prime is 20174711028643. The next prime is 20174711028697. The reversal of 20174711028649 is 94682011747102.
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 a cyclic number.
It is not a de Polignac number, because 20174711028649 - 29 = 20174711028137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20174711028596 and 20174711028605.
It is not an unprimeable number, because it can be changed into a prime (20174711028643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30466839 + ... + 31121980.
It is an arithmetic number, because the mean of its divisors is an integer number (5043693236260).
Almost surely, 220174711028649 is an apocalyptic number.
It is an amenable number.
20174711028649 is a deficient number, since it is larger than the sum of its proper divisors (61916391).
20174711028649 is an equidigital number, since it uses as much as digits as its factorization.
20174711028649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61916390.
The product of its (nonzero) digits is 1354752, while the sum is 52.
The spelling of 20174711028649 in words is "twenty trillion, one hundred seventy-four billion, seven hundred eleven million, twenty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •