Base | Representation |
---|---|
bin | 1100010010100010000… |
… | …0100100001111101101 |
3 | 202011222020000212021111 |
4 | 3010220200210033231 |
5 | 11424400023220323 |
6 | 240554305232021 |
7 | 21153034041430 |
oct | 3045040441755 |
9 | 664866025244 |
10 | 211133023213 |
11 | 815a50a6332 |
12 | 34b04032611 |
13 | 16ba9980388 |
14 | a30c8db817 |
15 | 575aa3cc0d |
hex | 31288243ed |
211133023213 has 4 divisors (see below), whose sum is σ = 241294883680. Its totient is φ = 180971162748.
The previous prime is 211133023181. The next prime is 211133023271. The reversal of 211133023213 is 312320331112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 211133023213 - 25 = 211133023181 is a prime.
It is a super-2 number, since 2×2111330232132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211133023613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15080930223 + ... + 15080930236.
It is an arithmetic number, because the mean of its divisors is an integer number (60323720920).
Almost surely, 2211133023213 is an apocalyptic number.
It is an amenable number.
211133023213 is a deficient number, since it is larger than the sum of its proper divisors (30161860467).
211133023213 is an equidigital number, since it uses as much as digits as its factorization.
211133023213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30161860466.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 211133023213 its reverse (312320331112), we get a palindrome (523453354325).
The spelling of 211133023213 in words is "two hundred eleven billion, one hundred thirty-three million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •