Base | Representation |
---|---|
bin | 10010101110101101… |
… | …110101110010100001 |
3 | 1220220120121211101102 |
4 | 102232231311302201 |
5 | 312141421342234 |
6 | 13123335044145 |
7 | 1311241466330 |
oct | 225655656241 |
9 | 56816554342 |
10 | 20111121569 |
11 | 8590227330 |
12 | 3a93210655 |
13 | 1b86713646 |
14 | d8ad6dd17 |
15 | 7ca8bac7e |
hex | 4aeb75ca1 |
20111121569 has 8 divisors (see below), whose sum is σ = 25073606208. Its totient is φ = 15671003760.
The previous prime is 20111121529. The next prime is 20111121571. The reversal of 20111121569 is 96512111102.
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 20111121569 - 220 = 20110072993 is a prime.
It is a super-2 number, since 2×201111215692 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20111121509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130591622 + ... + 130591775.
It is an arithmetic number, because the mean of its divisors is an integer number (3134200776).
Almost surely, 220111121569 is an apocalyptic number.
It is an amenable number.
20111121569 is a deficient number, since it is larger than the sum of its proper divisors (4962484639).
20111121569 is a wasteful number, since it uses less digits than its factorization.
20111121569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261183415.
The product of its (nonzero) digits is 1080, while the sum is 29.
The spelling of 20111121569 in words is "twenty billion, one hundred eleven million, one hundred twenty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •