Base | Representation |
---|---|
bin | 10100011111100011… |
… | …01100000101010101 |
3 | 1001101202101200210000 |
4 | 22033301230011111 |
5 | 140013014231401 |
6 | 5015421121513 |
7 | 536433216264 |
oct | 121761540525 |
9 | 31352350700 |
10 | 11002102101 |
11 | 4736444171 |
12 | 21706b9299 |
13 | 10644b23b3 |
14 | 76529a5db |
15 | 445d57186 |
hex | 28fc6c155 |
11002102101 has 40 divisors (see below), whose sum is σ = 16805726784. Its totient is φ = 7171234560.
The previous prime is 11002102091. The next prime is 11002102121. The reversal of 11002102101 is 10120120011.
It is a happy number.
11002102101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11002102101 - 213 = 11002093909 is a prime.
It is a super-2 number, since 2×110021021012 (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 (11002102121) 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 39 ways as a sum of consecutive naturals, for example, 643696 + ... + 660566.
Almost surely, 211002102101 is an apocalyptic number.
It is an amenable number.
11002102101 is a deficient number, since it is larger than the sum of its proper divisors (5803624683).
11002102101 is an equidigital number, since it uses as much as digits as its factorization.
11002102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17063 (or 17054 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11002102101 its reverse (10120120011), we get a palindrome (21122222112).
The spelling of 11002102101 in words is "eleven billion, two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •