Base | Representation |
---|---|
bin | 10010101110101101… |
… | …001010010010101001 |
3 | 1220220120021202222121 |
4 | 102232231022102221 |
5 | 312141400142101 |
6 | 13123331151241 |
7 | 1311240125023 |
oct | 225655122251 |
9 | 56816252877 |
10 | 20110943401 |
11 | 859011548a |
12 | 3a93145521 |
13 | 1b86680513 |
14 | d8ad25013 |
15 | 7ca8830a1 |
hex | 4aeb4a4a9 |
20110943401 has 4 divisors (see below), whose sum is σ = 20111443972. Its totient is φ = 20110442832.
The previous prime is 20110943399. The next prime is 20110943431. The reversal of 20110943401 is 10434901102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10434901102 = 2 ⋅5217450551.
It can be written as a sum of positive squares in 2 ways, for example, as 8704703401 + 11406240000 = 93299^2 + 106800^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110943401 - 21 = 20110943399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110943431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 184206 + ... + 272311.
It is an arithmetic number, because the mean of its divisors is an integer number (5027860993).
Almost surely, 220110943401 is an apocalyptic number.
It is an amenable number.
20110943401 is a deficient number, since it is larger than the sum of its proper divisors (500571).
20110943401 is an equidigital number, since it uses as much as digits as its factorization.
20110943401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500570.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 20110943401 in words is "twenty billion, one hundred ten million, nine hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •