Base | Representation |
---|---|
bin | 10100101100101001… |
… | …11010101011001001 |
3 | 1001200102012002122000 |
4 | 22112110322223021 |
5 | 140224133001301 |
6 | 5034344421213 |
7 | 542236305021 |
oct | 122624725311 |
9 | 31612162560 |
10 | 11112000201 |
11 | 4792486245 |
12 | 21a1477809 |
13 | 10811b0263 |
14 | 775b06a81 |
15 | 450814786 |
hex | 29653aac9 |
11112000201 has 8 divisors (see below), whose sum is σ = 16462222560. Its totient is φ = 7408000116.
The previous prime is 11112000181. The next prime is 11112000259. The reversal of 11112000201 is 10200021111.
It is a happy number.
11112000201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11112000201 - 25 = 11112000169 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 (11112000271) 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 7 ways as a sum of consecutive naturals, for example, 205777755 + ... + 205777808.
It is an arithmetic number, because the mean of its divisors is an integer number (2057777820).
Almost surely, 211112000201 is an apocalyptic number.
It is an amenable number.
11112000201 is a deficient number, since it is larger than the sum of its proper divisors (5350222359).
11112000201 is an equidigital number, since it uses as much as digits as its factorization.
11112000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411555572 (or 411555566 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11112000201 its reverse (10200021111), we get a palindrome (21312021312).
The spelling of 11112000201 in words is "eleven billion, one hundred twelve million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •