Base | Representation |
---|---|
bin | 10111111110010… |
… | …00111011001001 |
3 | 112000101222201020 |
4 | 23333020323021 |
5 | 402440213001 |
6 | 31542143053 |
7 | 4661221203 |
oct | 1377107311 |
9 | 460358636 |
10 | 201101001 |
11 | a3575182 |
12 | 57421a89 |
13 | 3288149a |
14 | 1c9cb773 |
15 | 129c5736 |
hex | bfc8ec9 |
201101001 has 4 divisors (see below), whose sum is σ = 268134672. Its totient is φ = 134067332.
The previous prime is 201100961. The next prime is 201101003. The reversal of 201101001 is 100101102.
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 201101001 - 29 = 201100489 is a prime.
It is a super-2 number, since 2×2011010012 = 80883225206404002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201101003) 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 3 ways as a sum of consecutive naturals, for example, 33516831 + ... + 33516836.
It is an arithmetic number, because the mean of its divisors is an integer number (67033668).
Almost surely, 2201101001 is an apocalyptic number.
It is an amenable number.
201101001 is a deficient number, since it is larger than the sum of its proper divisors (67033671).
201101001 is an equidigital number, since it uses as much as digits as its factorization.
201101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67033670.
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 201101001 is about 14181.0084620241. The cubic root of 201101001 is about 585.8746999588.
Adding to 201101001 its reverse (100101102), we get a palindrome (301202103).
The spelling of 201101001 in words is "two hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •