Base | Representation |
---|---|
bin | 101111111110100110100100… |
… | …101011101110001100011011 |
3 | 1000200010101020102110221200012 |
4 | 233332212210223232030123 |
5 | 210124142403032210021 |
6 | 2024440430334432135 |
7 | 62305661512406543 |
oct | 5776464453561433 |
9 | 1020111212427605 |
10 | 211010211210011 |
11 | 61263a232264a4 |
12 | 1b7bb23896264b |
13 | 9098240080c25 |
14 | 3a16d3d3bc323 |
15 | 195dcd6e2735b |
hex | bfe9a4aee31b |
211010211210011 has 4 divisors (see below), whose sum is σ = 211010822317152. Its totient is φ = 211009600102872.
The previous prime is 211010211209977. The next prime is 211010211210017. The reversal of 211010211210011 is 110012112010112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211010211210011 - 210 = 211010211208987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211010211210017) 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 3 ways as a sum of consecutive naturals, for example, 305035340 + ... + 305726313.
It is an arithmetic number, because the mean of its divisors is an integer number (52752705579288).
Almost surely, 2211010211210011 is an apocalyptic number.
211010211210011 is a deficient number, since it is larger than the sum of its proper divisors (611107141).
211010211210011 is an equidigital number, since it uses as much as digits as its factorization.
211010211210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611107140.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211010211210011 its reverse (110012112010112), we get a palindrome (321022323220123).
The spelling of 211010211210011 in words is "two hundred eleven trillion, ten billion, two hundred eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •