Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …0111111010000000001000 |
3 | 1110100010010001002222220122 |
4 | 2201223011213322000020 |
5 | 2424011441324001300 |
6 | 35343524314042412 |
7 | 2224451442223106 |
oct | 241530547720010 |
9 | 43303101088818 |
10 | 11110101000200 |
11 | 35a3849413a64 |
12 | 12b5266419408 |
13 | 6278a7824a97 |
14 | 2a5a35d2ac76 |
15 | 143eec5a2c85 |
hex | a1ac59fa008 |
11110101000200 has 48 divisors (see below), whose sum is σ = 25831977786000. Its totient is φ = 4443869568320.
The previous prime is 11110101000191. The next prime is 11110101000203. The reversal of 11110101000200 is 200010101111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (11110101000203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4213271 + ... + 6322329.
It is an arithmetic number, because the mean of its divisors is an integer number (538166203875).
Almost surely, 211110101000200 is an apocalyptic number.
11110101000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110101000200 is an abundant number, since it is smaller than the sum of its proper divisors (14721876785800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110101000200 is a wasteful number, since it uses less digits than its factorization.
11110101000200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2135414 (or 2135405 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11110101000200 its reverse (200010101111), we get a palindrome (11310111101311).
The spelling of 11110101000200 in words is "eleven trillion, one hundred ten billion, one hundred one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •