Base | Representation |
---|---|
bin | 100000110010000… |
… | …1010101111001001 |
3 | 2211122211210121012 |
4 | 1001210022233021 |
5 | 4223100001301 |
6 | 301052453305 |
7 | 36154563446 |
oct | 10144125711 |
9 | 2748753535 |
10 | 1100000201 |
11 | 514a15483 |
12 | 26847a235 |
13 | 146b80ac1 |
14 | a613c9cd |
15 | 66885ebb |
hex | 4190abc9 |
1100000201 has 4 divisors (see below), whose sum is σ = 1100114304. Its totient is φ = 1099886100.
The previous prime is 1100000197. The next prime is 1100000203. The reversal of 1100000201 is 1020000011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1100000201 - 22 = 1100000197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1100000203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41105 + ... + 62366.
It is an arithmetic number, because the mean of its divisors is an integer number (275028576).
Almost surely, 21100000201 is an apocalyptic number.
It is an amenable number.
1100000201 is a deficient number, since it is larger than the sum of its proper divisors (114103).
1100000201 is a wasteful number, since it uses less digits than its factorization.
1100000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114102.
The product of its (nonzero) digits is 2, while the sum is 5.
The square root of 1100000201 is about 33166.2509337429. The cubic root of 1100000201 is about 1032.2801783316.
Adding to 1100000201 its reverse (1020000011), we get a palindrome (2120000212).
The spelling of 1100000201 in words is "one billion, one hundred million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •