Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0100111110001001010001 |
3 | 1110022011022010100212020021 |
4 | 2201201301210332021101 |
5 | 2423331001324310001 |
6 | 35335152131343441 |
7 | 2223645564551533 |
oct | 241416144761121 |
9 | 43264263325207 |
10 | 11100101010001 |
11 | 359a587706353 |
12 | 12b3335451b81 |
13 | 626972b3bc13 |
14 | 2a5367bab853 |
15 | 143b146e7ba1 |
hex | a187193e251 |
11100101010001 has 8 divisors (see below), whose sum is σ = 11401506383904. Its totient is φ = 10802687760480.
The previous prime is 11100101009969. The next prime is 11100101010043. The reversal of 11100101010001 is 10001010100111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11100101010001 - 25 = 11100101009969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11100101010101) 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 7 ways as a sum of consecutive naturals, for example, 998025460 + ... + 998036581.
It is an arithmetic number, because the mean of its divisors is an integer number (1425188297988).
Almost surely, 211100101010001 is an apocalyptic number.
It is an amenable number.
11100101010001 is a deficient number, since it is larger than the sum of its proper divisors (301405373903).
11100101010001 is an equidigital number, since it uses as much as digits as its factorization.
11100101010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1996062191.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11100101010001 its reverse (10001010100111), we get a palindrome (21101111110112).
The spelling of 11100101010001 in words is "eleven trillion, one hundred billion, one hundred one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •