Base | Representation |
---|---|
bin | 10010101000101100… |
… | …001010110111000101 |
3 | 1220122112101100111201 |
4 | 102220230022313011 |
5 | 311440031122133 |
6 | 13105324102501 |
7 | 1305603236404 |
oct | 225054126705 |
9 | 56575340451 |
10 | 20010020293 |
11 | 853915345a |
12 | 3a65394a31 |
13 | 1b6b7a57c3 |
14 | d7b77363b |
15 | 7c1a99d7d |
hex | 4a8b0adc5 |
20010020293 has 8 divisors (see below), whose sum is σ = 20219655960. Its totient is φ = 19800453120.
The previous prime is 20010020281. The next prime is 20010020347. The reversal of 20010020293 is 39202001002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 36699364 + 19973320929 = 6058^2 + 141327^2 .
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 20010020293 - 213 = 20010012101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20010020293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010020243) 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, 747423 + ... + 773731.
It is an arithmetic number, because the mean of its divisors is an integer number (2527456995).
Almost surely, 220010020293 is an apocalyptic number.
It is an amenable number.
20010020293 is a deficient number, since it is larger than the sum of its proper divisors (209635667).
20010020293 is an equidigital number, since it uses as much as digits as its factorization.
20010020293 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34247.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20010020293 its reverse (39202001002), we get a palindrome (59212021295).
The spelling of 20010020293 in words is "twenty billion, ten million, twenty thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.695 sec. • engine limits •