Base | Representation |
---|---|
bin | 1100010010110100101… |
… | …0011010011100110001 |
3 | 202012011122221200020110 |
4 | 3010231022122130301 |
5 | 11430030020231001 |
6 | 241010134531533 |
7 | 21155002513404 |
oct | 3045512323461 |
9 | 665148850213 |
10 | 211211102001 |
11 | 81635185059 |
12 | 34b26206ba9 |
13 | 16bbcbba143 |
14 | a319023d3b |
15 | 57628123d6 |
hex | 312d29a731 |
211211102001 has 8 divisors (see below), whose sum is σ = 281628258304. Its totient is φ = 140800673520.
The previous prime is 211211101979. The next prime is 211211102023. The reversal of 211211102001 is 100201112112.
It is an interprime number because it is at equal distance from previous prime (211211101979) and next prime (211211102023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211211102001 - 27 = 211211101873 is a prime.
It is a super-2 number, since 2×2112111020012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (211211102051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1608241 + ... + 1734606.
It is an arithmetic number, because the mean of its divisors is an integer number (35203532288).
Almost surely, 2211211102001 is an apocalyptic number.
It is an amenable number.
211211102001 is a deficient number, since it is larger than the sum of its proper divisors (70417156303).
211211102001 is a wasteful number, since it uses less digits than its factorization.
211211102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3363911.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211211102001 its reverse (100201112112), we get a palindrome (311412214113).
The spelling of 211211102001 in words is "two hundred eleven billion, two hundred eleven million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •