Base | Representation |
---|---|
bin | 1100010010011010001… |
… | …1000011011110111101 |
3 | 202011212221010020221210 |
4 | 3010212203003132331 |
5 | 11424313112333041 |
6 | 240551132115033 |
7 | 21152154264606 |
oct | 3044643033675 |
9 | 664787106853 |
10 | 211100121021 |
11 | 81588573439 |
12 | 34ab5005a79 |
13 | 16ba2c0041a |
14 | a3083b4dad |
15 | 5757bde016 |
hex | 31268c37bd |
211100121021 has 8 divisors (see below), whose sum is σ = 283193619040. Its totient is φ = 139870018512.
The previous prime is 211100121007. The next prime is 211100121047. The reversal of 211100121021 is 120121001112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211100121021 - 211 = 211100118973 is a prime.
It is a super-2 number, since 2×2111001210212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211100120988 and 211100121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211100128021) 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, 215848306 + ... + 215849283.
It is an arithmetic number, because the mean of its divisors is an integer number (35399202380).
Almost surely, 2211100121021 is an apocalyptic number.
It is an amenable number.
211100121021 is a deficient number, since it is larger than the sum of its proper divisors (72093498019).
211100121021 is a wasteful number, since it uses less digits than its factorization.
211100121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431697755.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211100121021 its reverse (120121001112), we get a palindrome (331221122133).
The spelling of 211100121021 in words is "two hundred eleven billion, one hundred million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •