Base | Representation |
---|---|
bin | 10100101011011000… |
… | …00110010111110101 |
3 | 1001122200001111000011 |
4 | 22111230012113311 |
5 | 140213413101323 |
6 | 5033323220221 |
7 | 542046331513 |
oct | 122554062765 |
9 | 31580044004 |
10 | 11101300213 |
11 | 4787438183 |
12 | 2199977671 |
13 | 107bc04bc3 |
14 | 77451d4b3 |
15 | 44e8ee20d |
hex | 295b065f5 |
11101300213 has 4 divisors (see below), whose sum is σ = 11107678348. Its totient is φ = 11094922080.
The previous prime is 11101300207. The next prime is 11101300241. The reversal of 11101300213 is 31200310111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 209873169 + 10891427044 = 14487^2 + 104362^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101300213 - 25 = 11101300181 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101300193 and 11101300202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101301213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3186456 + ... + 3189937.
It is an arithmetic number, because the mean of its divisors is an integer number (2776919587).
Almost surely, 211101300213 is an apocalyptic number.
It is an amenable number.
11101300213 is a deficient number, since it is larger than the sum of its proper divisors (6378135).
11101300213 is an equidigital number, since it uses as much as digits as its factorization.
11101300213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6378134.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11101300213 its reverse (31200310111), we get a palindrome (42301610324).
The spelling of 11101300213 in words is "eleven billion, one hundred one million, three hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •