Base | Representation |
---|---|
bin | 10011101010010000… |
… | …011100110100110101 |
3 | 2000111012021122201110 |
4 | 103222100130310311 |
5 | 321213133100401 |
6 | 13410421345233 |
7 | 1345061315400 |
oct | 235220346465 |
9 | 60435248643 |
10 | 21110050101 |
11 | 8a530890a8 |
12 | 4111868219 |
13 | 1cb5666c0a |
14 | 10438bcd37 |
15 | 8384399d6 |
hex | 4ea41cd35 |
21110050101 has 24 divisors (see below), whose sum is σ = 34668129600. Its totient is φ = 11353302912.
The previous prime is 21110050063. The next prime is 21110050121. The reversal of 21110050101 is 10105001112.
It is not a de Polignac number, because 21110050101 - 227 = 20975832373 is a prime.
It is a super-2 number, since 2×211100501012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110050121) 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 23 ways as a sum of consecutive naturals, for example, 4221201 + ... + 4226198.
It is an arithmetic number, because the mean of its divisors is an integer number (1444505400).
Almost surely, 221110050101 is an apocalyptic number.
21110050101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21110050101 is a deficient number, since it is larger than the sum of its proper divisors (13558079499).
21110050101 is a wasteful number, since it uses less digits than its factorization.
21110050101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8447433 (or 8447426 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 21110050101 its reverse (10105001112), we get a palindrome (31215051213).
The spelling of 21110050101 in words is "twenty-one billion, one hundred ten million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •