Base | Representation |
---|---|
bin | 100000001011001010011… |
… | …110101001001111001001 |
3 | 21211101000002210201021111 |
4 | 200023022132221033021 |
5 | 242211122104033001 |
6 | 4411420222210321 |
7 | 315511615534531 |
oct | 40131236511711 |
9 | 7741002721244 |
10 | 2211010221001 |
11 | 7827586a0a8a |
12 | 2b8612a239a1 |
13 | 1306609491ca |
14 | 79028d424c1 |
15 | 3c7a7d5e851 |
hex | 202ca7a93c9 |
2211010221001 has 8 divisors (see below), whose sum is σ = 2266063658208. Its totient is φ = 2156010420000.
The previous prime is 2211010220987. The next prime is 2211010221047. The reversal of 2211010221001 is 1001220101122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2211010221001 - 211 = 2211010218953 is a prime.
It is a super-2 number, since 2×22110102210012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2211010224001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13325575 + ... + 13490476.
It is an arithmetic number, because the mean of its divisors is an integer number (283257957276).
Almost surely, 22211010221001 is an apocalyptic number.
It is an amenable number.
2211010221001 is a deficient number, since it is larger than the sum of its proper divisors (55053437207).
2211010221001 is a wasteful number, since it uses less digits than its factorization.
2211010221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26818103.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2211010221001 its reverse (1001220101122), we get a palindrome (3212230322123).
The spelling of 2211010221001 in words is "two trillion, two hundred eleven billion, ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •