Base | Representation |
---|---|
bin | 1001000111000000101110… |
… | …11010000001001100011011 |
3 | 2121221001101220012221211221 |
4 | 10203200113122001030123 |
5 | 10111201240230241042 |
6 | 110334343504432511 |
7 | 4135162416642136 |
oct | 443402732011433 |
9 | 77831356187757 |
10 | 20032120165147 |
11 | 6423635662572 |
12 | 22b6438618737 |
13 | b240369a730c |
14 | 4d37ba0c121d |
15 | 24b134babd67 |
hex | 12381768131b |
20032120165147 has 8 divisors (see below), whose sum is σ = 20161097057696. Its totient is φ = 19903160788992.
The previous prime is 20032120165139. The next prime is 20032120165177. The reversal of 20032120165147 is 74156102123002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20032120165147 - 23 = 20032120165139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20032120165177) 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 7 ways as a sum of consecutive naturals, for example, 2080623 + ... + 6662824.
It is an arithmetic number, because the mean of its divisors is an integer number (2520137132212).
Almost surely, 220032120165147 is an apocalyptic number.
20032120165147 is a deficient number, since it is larger than the sum of its proper divisors (128976892549).
20032120165147 is a wasteful number, since it uses less digits than its factorization.
20032120165147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8758197.
The product of its (nonzero) digits is 20160, while the sum is 34.
Adding to 20032120165147 its reverse (74156102123002), we get a palindrome (94188222288149).
The spelling of 20032120165147 in words is "twenty trillion, thirty-two billion, one hundred twenty million, one hundred sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •