Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …0111011000101000001001 |
3 | 1110100002212000102211022100 |
4 | 2201222333213120220021 |
5 | 2424011240022401301 |
6 | 35343510313344013 |
7 | 2224446106356420 |
oct | 241527747305011 |
9 | 43302760384270 |
10 | 11110000200201 |
11 | 35a37a7526481 |
12 | 12b5238708009 |
13 | 62788c991106 |
14 | 2a5a267ac2b7 |
15 | 143ee37e1286 |
hex | a1abf9d8a09 |
11110000200201 has 96 divisors (see below), whose sum is σ = 19080303390720. Its totient is φ = 6097824732672.
The previous prime is 11110000200127. The next prime is 11110000200209. The reversal of 11110000200201 is 10200200001111.
It is a happy number.
11110000200201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11110000200201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11110000200209) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 103542886 + ... + 103650128.
It is an arithmetic number, because the mean of its divisors is an integer number (198753160320).
Almost surely, 211110000200201 is an apocalyptic number.
It is an amenable number.
11110000200201 is a deficient number, since it is larger than the sum of its proper divisors (7970303190519).
11110000200201 is a wasteful number, since it uses less digits than its factorization.
11110000200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107955 (or 107952 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11110000200201 its reverse (10200200001111), we get a palindrome (21310200201312).
The spelling of 11110000200201 in words is "eleven trillion, one hundred ten billion, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •