Base | Representation |
---|---|
bin | 1000001100110000… |
… | …1100001100111001 |
3 | 12200101120221110222 |
4 | 2003030030030321 |
5 | 14001424323001 |
6 | 1002223145425 |
7 | 105354166460 |
oct | 20314141471 |
9 | 5611527428 |
10 | 2201011001 |
11 | a2a460162 |
12 | 515145275 |
13 | 290cc6897 |
14 | 16c4619d7 |
15 | cd36b61b |
hex | 8330c339 |
2201011001 has 8 divisors (see below), whose sum is σ = 2515855680. Its totient is φ = 1886269968.
The previous prime is 2201010979. The next prime is 2201011009. The reversal of 2201011001 is 1001101022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2201011001 - 218 = 2200748857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2201011001.
It is not an unprimeable number, because it can be changed into a prime (2201011009) 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 7 ways as a sum of consecutive naturals, for example, 26735 + ... + 71531.
It is an arithmetic number, because the mean of its divisors is an integer number (314481960).
Almost surely, 22201011001 is an apocalyptic number.
It is an amenable number.
2201011001 is a deficient number, since it is larger than the sum of its proper divisors (314844679).
2201011001 is an equidigital number, since it uses as much as digits as its factorization.
2201011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51823.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 2201011001 is about 46914.9336672237. The cubic root of 2201011001 is about 1300.7906435008.
Adding to 2201011001 its reverse (1001101022), we get a palindrome (3202112023).
The spelling of 2201011001 in words is "two billion, two hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •