Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100100001111001111 |
3 | 1220220111111220101200 |
4 | 102232221210033033 |
5 | 312141130013403 |
6 | 13123255040543 |
7 | 1311226121553 |
oct | 225651441717 |
9 | 56814456350 |
10 | 20110001103 |
11 | 858a631525 |
12 | 3a92970153 |
13 | 1b8641064a |
14 | d8ab5b863 |
15 | 7ca748ca3 |
hex | 4aea643cf |
20110001103 has 48 divisors (see below), whose sum is σ = 30493322496. Its totient is φ = 12755957760.
The previous prime is 20110001101. The next prime is 20110001111. The reversal of 20110001103 is 30110001102.
It is not a de Polignac number, because 20110001103 - 21 = 20110001101 is a prime.
It is a super-2 number, since 2×201100011032 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110001101) 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 47 ways as a sum of consecutive naturals, for example, 4246525 + ... + 4251257.
It is an arithmetic number, because the mean of its divisors is an integer number (635277552).
Almost surely, 220110001103 is an apocalyptic number.
20110001103 is a deficient number, since it is larger than the sum of its proper divisors (10383321393).
20110001103 is a wasteful number, since it uses less digits than its factorization.
20110001103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5024 (or 5021 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 20110001103 its reverse (30110001102), we get a palindrome (50220002205).
Subtracting 20110001103 from its reverse (30110001102), we obtain a palindrome (9999999999).
The spelling of 20110001103 in words is "twenty billion, one hundred ten million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •