Base | Representation |
---|---|
bin | 1001001110110111111110… |
… | …11000101011011000010001 |
3 | 2122212212210012102201120221 |
4 | 10213123333120223120101 |
5 | 10130113102311200423 |
6 | 111102425314233041 |
7 | 4163535631333423 |
oct | 447337730533021 |
9 | 78785705381527 |
10 | 20302300100113 |
11 | 6518180143619 |
12 | 233a87b285781 |
13 | b436637c1215 |
14 | 5028caa56813 |
15 | 253199435e5d |
hex | 1276ff62b611 |
20302300100113 has 6 divisors (see below), whose sum is σ = 21026520080774. Its totient is φ = 19602220785504.
The previous prime is 20302300100077. The next prime is 20302300100231. The reversal of 20302300100113 is 31100100320302.
It can be written as a sum of positive squares in 3 ways, for example, as 4439229874704 + 15863070225409 = 2106948^2 + 3982847^2 .
It is not a de Polignac number, because 20302300100113 - 237 = 20164861146641 is a prime.
It is a super-2 number, since 2×203023001001132 (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 (20302300100413) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12070332156 + ... + 12070333837.
Almost surely, 220302300100113 is an apocalyptic number.
It is an amenable number.
20302300100113 is a deficient number, since it is larger than the sum of its proper divisors (724219980661).
20302300100113 is an equidigital number, since it uses as much as digits as its factorization.
20302300100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24140666051 (or 24140666022 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20302300100113 its reverse (31100100320302), we get a palindrome (51402400420415).
The spelling of 20302300100113 in words is "twenty trillion, three hundred two billion, three hundred million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •