Base | Representation |
---|---|
bin | 10010110100000001… |
… | …010001100011001101 |
3 | 1221010210001111201101 |
4 | 102310001101203031 |
5 | 312332211231333 |
6 | 13140234143101 |
7 | 1313402014633 |
oct | 226401214315 |
9 | 57123044641 |
10 | 20200102093 |
11 | 8626481756 |
12 | 3ab8b81a91 |
13 | 1b9bc99542 |
14 | d98ad3353 |
15 | 7d35e567d |
hex | 4b40518cd |
20200102093 has 4 divisors (see below), whose sum is σ = 20200736668. Its totient is φ = 20199467520.
The previous prime is 20200102081. The next prime is 20200102103. The reversal of 20200102093 is 39020100202.
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 9108220969 + 11091881124 = 95437^2 + 105318^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20200102093 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 20200102093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200102193) 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, 266868 + ... + 334093.
It is an arithmetic number, because the mean of its divisors is an integer number (5050184167).
Almost surely, 220200102093 is an apocalyptic number.
It is an amenable number.
20200102093 is a deficient number, since it is larger than the sum of its proper divisors (634575).
20200102093 is an equidigital number, since it uses as much as digits as its factorization.
20200102093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 634574.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20200102093 its reverse (39020100202), we get a palindrome (59220202295).
The spelling of 20200102093 in words is "twenty billion, two hundred million, one hundred two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •