Base | Representation |
---|---|
bin | 101111111110100110100100… |
… | …100111000111000001110011 |
3 | 1000200010101020100012112020102 |
4 | 233332212210213013001303 |
5 | 210124142402230013021 |
6 | 2024440430252503015 |
7 | 62305661466213011 |
oct | 5776464447070163 |
9 | 1020111210175212 |
10 | 211010210001011 |
11 | 61263a22580123 |
12 | 1b7bb23847aa6b |
13 | 909823ca49845 |
14 | 3a16d3d1858b1 |
15 | 195dcd6c8900b |
hex | bfe9a49c7073 |
211010210001011 has 8 divisors (see below), whose sum is σ = 222240584881920. Its totient is φ = 199792292555592.
The previous prime is 211010210001001. The next prime is 211010210001061. The reversal of 211010210001011 is 110100012010112.
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 211010210001011 - 222 = 211010205806707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211010210000983 and 211010210001001.
It is not an unprimeable number, because it can be changed into a prime (211010210001001) 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, 3114324095 + ... + 3114391848.
It is an arithmetic number, because the mean of its divisors is an integer number (27780073110240).
Almost surely, 2211010210001011 is an apocalyptic number.
211010210001011 is a deficient number, since it is larger than the sum of its proper divisors (11230374880909).
211010210001011 is a wasteful number, since it uses less digits than its factorization.
211010210001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6228717745.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 211010210001011 its reverse (110100012010112), we get a palindrome (321110222011123).
The spelling of 211010210001011 in words is "two hundred eleven trillion, ten billion, two hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •