Base | Representation |
---|---|
bin | 10010101110010000… |
… | …000011001101011101 |
3 | 1220220000221001222022 |
4 | 102232100003031131 |
5 | 312132421442341 |
6 | 13122455425525 |
7 | 1311115222466 |
oct | 225620031535 |
9 | 56800831868 |
10 | 20103312221 |
11 | 8586883023 |
12 | 3a906852a5 |
13 | 1b84c0ac25 |
14 | d89cd9d6d |
15 | 7c9d76e4b |
hex | 4ae40335d |
20103312221 has 8 divisors (see below), whose sum is σ = 20130572280. Its totient is φ = 20076072192.
The previous prime is 20103312217. The next prime is 20103312293. The reversal of 20103312221 is 12221330102.
It can be written as a sum of positive squares in 4 ways, for example, as 7104804100 + 12998508121 = 84290^2 + 114011^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 20103312221 - 22 = 20103312217 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 20103312221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20103314221) 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, 3307241 + ... + 3313313.
It is an arithmetic number, because the mean of its divisors is an integer number (2516321535).
Almost surely, 220103312221 is an apocalyptic number.
It is an amenable number.
20103312221 is a deficient number, since it is larger than the sum of its proper divisors (27260059).
20103312221 is a wasteful number, since it uses less digits than its factorization.
20103312221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10015.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20103312221 its reverse (12221330102), we get a palindrome (32324642323).
The spelling of 20103312221 in words is "twenty billion, one hundred three million, three hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •