Base | Representation |
---|---|
bin | 10010111110001101… |
… | …010001100110010001 |
3 | 1221120200200001020210 |
4 | 102332031101212101 |
5 | 313204440121202 |
6 | 13205221354333 |
7 | 1320545546244 |
oct | 227615214621 |
9 | 57520601223 |
10 | 20371020177 |
11 | 8703a00a72 |
12 | 3b462689a9 |
13 | 1bc85106c1 |
14 | db36a525b |
15 | 7e3607c6c |
hex | 4be351991 |
20371020177 has 4 divisors (see below), whose sum is σ = 27161360240. Its totient is φ = 13580680116.
The previous prime is 20371020161. The next prime is 20371020199. The reversal of 20371020177 is 77102017302.
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 20371020177 - 24 = 20371020161 is a prime.
It is a super-2 number, since 2×203710201772 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20371020127) 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 in 3 ways as a sum of consecutive naturals, for example, 3395170027 + ... + 3395170032.
It is an arithmetic number, because the mean of its divisors is an integer number (6790340060).
Almost surely, 220371020177 is an apocalyptic number.
It is an amenable number.
20371020177 is a deficient number, since it is larger than the sum of its proper divisors (6790340063).
20371020177 is an equidigital number, since it uses as much as digits as its factorization.
20371020177 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6790340062.
The product of its (nonzero) digits is 4116, while the sum is 30.
Adding to 20371020177 its reverse (77102017302), we get a palindrome (97473037479).
The spelling of 20371020177 in words is "twenty billion, three hundred seventy-one million, twenty thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •