Base | Representation |
---|---|
bin | 1001001001010011101100… |
… | …01101001000010001010110 |
3 | 2122012121001120020112101220 |
4 | 10210221312031020101112 |
5 | 10113444332112024420 |
6 | 110434513002431210 |
7 | 4143654552520536 |
oct | 444516615102126 |
9 | 78177046215356 |
10 | 20111020033110 |
11 | 6454043574116 |
12 | 2309797b02506 |
13 | b2b5cbc13316 |
14 | 4d7542ac54c6 |
15 | 24d2017ba840 |
hex | 124a76348456 |
20111020033110 has 64 divisors (see below), whose sum is σ = 48441934877184. Its totient is φ = 5343443078400.
The previous prime is 20111020033087. The next prime is 20111020033127. The reversal of 20111020033110 is 1133002011102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20111020033110.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 118837455 + ... + 119006565.
It is an arithmetic number, because the mean of its divisors is an integer number (756905232456).
Almost surely, 220111020033110 is an apocalyptic number.
20111020033110 is an abundant number, since it is smaller than the sum of its proper divisors (28330914844074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111020033110 is a wasteful number, since it uses less digits than its factorization.
20111020033110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183509.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 20111020033110 its reverse (1133002011102), we get a palindrome (21244022044212).
The spelling of 20111020033110 in words is "twenty trillion, one hundred eleven billion, twenty million, thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •