Base | Representation |
---|---|
bin | 101111111110110000101110… |
… | …111001011101001111101010 |
3 | 1000200011102101200021221200011 |
4 | 233332300232321131033222 |
5 | 210124332223210013002 |
6 | 2024445433024002134 |
7 | 62306526033533113 |
oct | 5776605671351752 |
9 | 1020142350257604 |
10 | 211021120001002 |
11 | 61268610a27643 |
12 | 1b80138216034a |
13 | 909928b12223c |
14 | 3a1769610920a |
15 | 195e22499b8d7 |
hex | bfec2ee5d3ea |
211021120001002 has 8 divisors (see below), whose sum is σ = 318280473814212. Its totient is φ = 104927628729600.
The previous prime is 211021120000979. The next prime is 211021120001009. The reversal of 211021120001002 is 200100021120112.
It can be written as a sum of positive squares in 2 ways, for example, as 139412781967761 + 71608338033241 = 11807319^2 + 8462171^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2110211200010023 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (211021120001009) 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, 291465634999 + ... + 291465635722.
Almost surely, 2211021120001002 is an apocalyptic number.
211021120001002 is a deficient number, since it is larger than the sum of its proper divisors (107259353813210).
211021120001002 is a wasteful number, since it uses less digits than its factorization.
211021120001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582931270904.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211021120001002 its reverse (200100021120112), we get a palindrome (411121141121114).
The spelling of 211021120001002 in words is "two hundred eleven trillion, twenty-one billion, one hundred twenty million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •