Base | Representation |
---|---|
bin | 100000000001111011110… |
… | …010001001111011101001 |
3 | 21210102102102222101011022 |
4 | 200001323302021323221 |
5 | 242030323100013001 |
6 | 4403101003542225 |
7 | 315011211211046 |
oct | 40017362117351 |
9 | 7712372871138 |
10 | 2201100001001 |
11 | 779532628020 |
12 | 2b6707b2a975 |
13 | 12c7417347c5 |
14 | 78768ab01cd |
15 | 3c3c7cd811b |
hex | 2007bc89ee9 |
2201100001001 has 4 divisors (see below), whose sum is σ = 2401200001104. Its totient is φ = 2001000000900.
The previous prime is 2201100000997. The next prime is 2201100001013. The reversal of 2201100001001 is 1001000011022.
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 2201100001001 - 22 = 2201100000997 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 2201100001001.
It is not an unprimeable number, because it can be changed into a prime (2201100001021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100050000035 + ... + 100050000056.
It is an arithmetic number, because the mean of its divisors is an integer number (600300000276).
Almost surely, 22201100001001 is an apocalyptic number.
It is an amenable number.
2201100001001 is a deficient number, since it is larger than the sum of its proper divisors (200100000103).
2201100001001 is a wasteful number, since it uses less digits than its factorization.
2201100001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200100000102.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2201100001001 its reverse (1001000011022), we get a palindrome (3202100012023).
The spelling of 2201100001001 in words is "two trillion, two hundred one billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •