Base | Representation |
---|---|
bin | 1001001111101011110100… |
… | …01111001001001100000001 |
3 | 2122222112121210012000220002 |
4 | 10213311322033021030001 |
5 | 10131042102014031423 |
6 | 111123311103125345 |
7 | 4165542412156412 |
oct | 447657217111401 |
9 | 78875553160802 |
10 | 20330131002113 |
11 | 6528a61a44179 |
12 | 23441478a3855 |
13 | b4617a68437a |
14 | 503daad89809 |
15 | 253c778e9228 |
hex | 127d7a3c9301 |
20330131002113 has 8 divisors (see below), whose sum is σ = 20476654380000. Its totient is φ = 20183611387968.
The previous prime is 20330131002101. The next prime is 20330131002119. The reversal of 20330131002113 is 31120013103302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20330131002113 is a prime.
It is a super-2 number, since 2×203301310021132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20330131002119) 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, 10391138 + ... + 12191636.
It is an arithmetic number, because the mean of its divisors is an integer number (2559581797500).
Almost surely, 220330131002113 is an apocalyptic number.
It is an amenable number.
20330131002113 is a deficient number, since it is larger than the sum of its proper divisors (146523377887).
20330131002113 is a wasteful number, since it uses less digits than its factorization.
20330131002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1881871.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20330131002113 its reverse (31120013103302), we get a palindrome (51450144105415).
The spelling of 20330131002113 in words is "twenty trillion, three hundred thirty billion, one hundred thirty-one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •