Base | Representation |
---|---|
bin | 10100110111010001… |
… | …10011110011001000 |
3 | 1001220121211212221121 |
4 | 22123220303303020 |
5 | 140414440213000 |
6 | 5051250245024 |
7 | 544400534065 |
oct | 123350636310 |
9 | 31817755847 |
10 | 11201101000 |
11 | 4828802a71 |
12 | 2207286774 |
13 | 10967a8b1b |
14 | 78389bc6c |
15 | 458564b1a |
hex | 29ba33cc8 |
11201101000 has 32 divisors (see below), whose sum is σ = 26210578680. Its totient is φ = 4480440000.
The previous prime is 11201100979. The next prime is 11201101019. The reversal of 11201101000 is 10110211.
11201101000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1923173316 + 9277927684 = 43854^2 + 96322^2 .
It is a super-2 number, since 2×112011010002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 5599551 + ... + 5601550.
Almost surely, 211201101000 is an apocalyptic number.
11201101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11201101000 is an abundant number, since it is smaller than the sum of its proper divisors (15009477680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201101000 is a wasteful number, since it uses less digits than its factorization.
11201101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11201122 (or 11201108 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11201101000 its reverse (10110211), we get a palindrome (11211211211).
The spelling of 11201101000 in words is "eleven billion, two hundred one million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •