Base | Representation |
---|---|
bin | 1001001001011110010011… |
… | …00101111011011011010111 |
3 | 2122020010202101110112201222 |
4 | 10210233021211323123113 |
5 | 10114043012241312302 |
6 | 110441254004240555 |
7 | 4144245632523314 |
oct | 444571145733327 |
9 | 78203671415658 |
10 | 20116714010327 |
11 | 64564a5687510 |
12 | 230a9069a015b |
13 | b2bcc8782acc |
14 | 4d7922dd3d0b |
15 | 24d436604da2 |
hex | 124bc997b6d7 |
20116714010327 has 8 divisors (see below), whose sum is σ = 22246129566480. Its totient is φ = 18037402349760.
The previous prime is 20116714010291. The next prime is 20116714010329. The reversal of 20116714010327 is 72301041761102.
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 20116714010327 - 210 = 20116714009303 is a prime.
It is a super-2 number, since 2×201167140103272 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116714010329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12525973052 + ... + 12525974657.
It is an arithmetic number, because the mean of its divisors is an integer number (2780766195810).
Almost surely, 220116714010327 is an apocalyptic number.
20116714010327 is a deficient number, since it is larger than the sum of its proper divisors (2129415556153).
20116714010327 is a wasteful number, since it uses less digits than its factorization.
20116714010327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25051947793.
The product of its (nonzero) digits is 14112, while the sum is 35.
Adding to 20116714010327 its reverse (72301041761102), we get a palindrome (92417755771429).
The spelling of 20116714010327 in words is "twenty trillion, one hundred sixteen billion, seven hundred fourteen million, ten thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •