Base | Representation |
---|---|
bin | 1100010010000100101… |
… | …1101001111100001001 |
3 | 202011122122201202200222 |
4 | 3010201023221330021 |
5 | 11424122041213001 |
6 | 240534154435425 |
7 | 21150012156560 |
oct | 3044113517411 |
9 | 664578652628 |
10 | 211010101001 |
11 | 81541779027 |
12 | 34a8aa32b75 |
13 | 16b8a37233b |
14 | a2da460bd7 |
15 | 574ed5b61b |
hex | 31212e9f09 |
211010101001 has 8 divisors (see below), whose sum is σ = 241237323840. Its totient is φ = 180803608848.
The previous prime is 211010100941. The next prime is 211010101097. The reversal of 211010101001 is 100101010112.
It is a happy number.
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 211010101001 - 214 = 211010084617 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 211010101001.
It is not an unprimeable number, because it can be changed into a prime (211010101501) 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 7 ways as a sum of consecutive naturals, for example, 5160851 + ... + 5201576.
It is an arithmetic number, because the mean of its divisors is an integer number (30154665480).
Almost surely, 2211010101001 is an apocalyptic number.
It is an amenable number.
211010101001 is a deficient number, since it is larger than the sum of its proper divisors (30227222839).
211010101001 is a wasteful number, since it uses less digits than its factorization.
211010101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10365343.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 211010101001 its reverse (100101010112), we get a palindrome (311111111113).
The spelling of 211010101001 in words is "two hundred eleven billion, ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •