Base | Representation |
---|---|
bin | 10100110111010001… |
… | …10011100011100001 |
3 | 1001220121211211120121 |
4 | 22123220303203201 |
5 | 140414440200001 |
6 | 5051250240241 |
7 | 544400531140 |
oct | 123350634341 |
9 | 31817754517 |
10 | 11201100001 |
11 | 4828802243 |
12 | 2207286081 |
13 | 10967a8530 |
14 | 78389b757 |
15 | 4585646a1 |
hex | 29ba338e1 |
11201100001 has 32 divisors (see below), whose sum is σ = 14865580800. Its totient is φ = 8191134720.
The previous prime is 11201099993. The next prime is 11201100007. The reversal of 11201100001 is 10000110211.
11201100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11201100001 - 23 = 11201099993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (11201100007) 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 31 ways as a sum of consecutive naturals, for example, 8116 + ... + 149893.
It is an arithmetic number, because the mean of its divisors is an integer number (464549400).
Almost surely, 211201100001 is an apocalyptic number.
It is an amenable number.
11201100001 is a deficient number, since it is larger than the sum of its proper divisors (3664480799).
11201100001 is a wasteful number, since it uses less digits than its factorization.
11201100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158089.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11201100001 its reverse (10000110211), we get a palindrome (21201210212).
The spelling of 11201100001 in words is "eleven billion, two hundred one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •