Base | Representation |
---|---|
bin | 101111111110100110100100… |
… | …000000111111110101110101 |
3 | 1000200010101012122101221021201 |
4 | 233332212210000333311311 |
5 | 210124142342200310401 |
6 | 2024440425254412501 |
7 | 62305661315252002 |
oct | 5776464400776565 |
9 | 1020111178357251 |
10 | 211010200010101 |
11 | 61263a17976878 |
12 | 1b7bb235061131 |
13 | 909823a95c16b |
14 | 3a16d3bb048a9 |
15 | 195dcd5e63b01 |
hex | bfe9a403fd75 |
211010200010101 has 16 divisors (see below), whose sum is σ = 214115015347200. Its totient is φ = 207922795521408.
The previous prime is 211010200010017. The next prime is 211010200010107. The reversal of 211010200010101 is 101010002010112.
It is a cyclic number.
It is not a de Polignac number, because 211010200010101 - 211 = 211010200008053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211010200010107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30589255 + ... + 36847291.
It is an arithmetic number, because the mean of its divisors is an integer number (13382188459200).
Almost surely, 2211010200010101 is an apocalyptic number.
It is an amenable number.
211010200010101 is a deficient number, since it is larger than the sum of its proper divisors (3104815337099).
211010200010101 is an equidigital number, since it uses as much as digits as its factorization.
211010200010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6259428.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211010200010101 its reverse (101010002010112), we get a palindrome (312020202020213).
The spelling of 211010200010101 in words is "two hundred eleven trillion, ten billion, two hundred million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •