Base | Representation |
---|---|
bin | 10100011111011011… |
… | …10111011101000101 |
3 | 1001101200111210021220 |
4 | 22033231313131011 |
5 | 140012240200401 |
6 | 5015343430553 |
7 | 536421544065 |
oct | 121755673505 |
9 | 31350453256 |
10 | 11001100101 |
11 | 473591a372 |
12 | 21702b5459 |
13 | 10642212b4 |
14 | 7650b93a5 |
15 | 445c0a336 |
hex | 28fb77745 |
11001100101 has 4 divisors (see below), whose sum is σ = 14668133472. Its totient is φ = 7334066732.
The previous prime is 11001100093. The next prime is 11001100139. The reversal of 11001100101 is 10100110011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11001100101 - 23 = 11001100093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001100801) 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, 1833516681 + ... + 1833516686.
It is an arithmetic number, because the mean of its divisors is an integer number (3667033368).
Almost surely, 211001100101 is an apocalyptic number.
It is an amenable number.
11001100101 is a deficient number, since it is larger than the sum of its proper divisors (3667033371).
11001100101 is an equidigital number, since it uses as much as digits as its factorization.
11001100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3667033370.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11001100101 its reverse (10100110011), we get a palindrome (21101210112).
It can be divided in two parts, 1100110010 and 1, that added together give a palindrome (1100110011).
The spelling of 11001100101 in words is "eleven billion, one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •