Base | Representation |
---|---|
bin | 10010101001010011… |
… | …000111011111100001 |
3 | 1220200020121001202012 |
4 | 102221103013133201 |
5 | 312000134330423 |
6 | 13110331002305 |
7 | 1306056101552 |
oct | 225123073741 |
9 | 56606531665 |
10 | 20020230113 |
11 | 8543997224 |
12 | 3a68899395 |
13 | 1b7093ba10 |
14 | d7cc70329 |
15 | 7c2915078 |
hex | 4a94c77e1 |
20020230113 has 4 divisors (see below), whose sum is σ = 21560247828. Its totient is φ = 18480212400.
The previous prime is 20020230031. The next prime is 20020230133. The reversal of 20020230113 is 31103202002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3092138449 + 16928091664 = 55607^2 + 130108^2 .
It is not a de Polignac number, because 20020230113 - 28 = 20020229857 is a prime.
It is a super-2 number, since 2×200202301132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20020230133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 770008838 + ... + 770008863.
It is an arithmetic number, because the mean of its divisors is an integer number (5390061957).
Almost surely, 220020230113 is an apocalyptic number.
It is an amenable number.
20020230113 is a deficient number, since it is larger than the sum of its proper divisors (1540017715).
20020230113 is a wasteful number, since it uses less digits than its factorization.
20020230113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1540017714.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20020230113 its reverse (31103202002), we get a palindrome (51123432115).
The spelling of 20020230113 in words is "twenty billion, twenty million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •