Base | Representation |
---|---|
bin | 1001001111101100001001… |
… | …00000011010010111111001 |
3 | 2122222120001210101201200112 |
4 | 10213312010200122113321 |
5 | 10131042430121113423 |
6 | 111123340140114105 |
7 | 4165546603532021 |
oct | 447660440322771 |
9 | 78876053351615 |
10 | 20330303301113 |
11 | 6529040226a43 |
12 | 2344195535935 |
13 | b461a728cc40 |
14 | 503dc5bdaa81 |
15 | 253c87ad0a78 |
hex | 127d8481a5f9 |
20330303301113 has 8 divisors (see below), whose sum is σ = 21894923534400. Its totient is φ = 18765790317648.
The previous prime is 20330303301037. The next prime is 20330303301149. The reversal of 20330303301113 is 31110330303302.
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 20330303301113 - 216 = 20330303235577 is a prime.
It is a super-2 number, since 2×203303033011132 (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 (20330303201113) 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, 26418533 + ... + 27177186.
It is an arithmetic number, because the mean of its divisors is an integer number (2736865441800).
Almost surely, 220330303301113 is an apocalyptic number.
It is an amenable number.
20330303301113 is a deficient number, since it is larger than the sum of its proper divisors (1564620233287).
20330303301113 is a wasteful number, since it uses less digits than its factorization.
20330303301113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53624911.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 20330303301113 its reverse (31110330303302), we get a palindrome (51440633604415).
The spelling of 20330303301113 in words is "twenty trillion, three hundred thirty billion, three hundred three million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •