Base | Representation |
---|---|
bin | 101111111110110000100111… |
… | …110111010100101100111011 |
3 | 1000200011102002110020221101112 |
4 | 233332300213313110230323 |
5 | 210124332003003014321 |
6 | 2024445413210510535 |
7 | 62306523101542313 |
oct | 5776604767245473 |
9 | 1020142073227345 |
10 | 211021002001211 |
11 | 61268560361656 |
12 | 1b80134a73544b |
13 | 909926c84888c |
14 | 3a17684590443 |
15 | 195e21943da5b |
hex | bfec27dd4b3b |
211021002001211 has 4 divisors (see below), whose sum is σ = 211059320692392. Its totient is φ = 210982683310032.
The previous prime is 211021002001207. The next prime is 211021002001253. The reversal of 211021002001211 is 112100200120112.
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 211021002001211 - 22 = 211021002001207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211021002021211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19159337330 + ... + 19159348343.
It is an arithmetic number, because the mean of its divisors is an integer number (52764830173098).
Almost surely, 2211021002001211 is an apocalyptic number.
211021002001211 is a deficient number, since it is larger than the sum of its proper divisors (38318691181).
211021002001211 is an equidigital number, since it uses as much as digits as its factorization.
211021002001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38318691180.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211021002001211 its reverse (112100200120112), we get a palindrome (323121202121323).
The spelling of 211021002001211 in words is "two hundred eleven trillion, twenty-one billion, two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •