Base | Representation |
---|---|
bin | 1100010010011010101… |
… | …0101110010001111011 |
3 | 202011220001220101120102 |
4 | 3010212222232101323 |
5 | 11424314121200243 |
6 | 240551243150015 |
7 | 21152210336546 |
oct | 3044652562173 |
9 | 664801811512 |
10 | 211102131323 |
11 | 81589716846 |
12 | 34ab581530b |
13 | 16ba3455455 |
14 | a30877985d |
15 | 5757e899b8 |
hex | 3126aae47b |
211102131323 has 8 divisors (see below), whose sum is σ = 216518971968. Its totient is φ = 205723845184.
The previous prime is 211102131299. The next prime is 211102131337. The reversal of 211102131323 is 323131201112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211102131323 - 218 = 211101869179 is a prime.
It is a super-2 number, since 2×2111021313232 (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 = 211102131295 and 211102131304.
It is not an unprimeable number, because it can be changed into a prime (211102131343) 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, 9627536 + ... + 9649437.
It is an arithmetic number, because the mean of its divisors is an integer number (27064871496).
Almost surely, 2211102131323 is an apocalyptic number.
211102131323 is a deficient number, since it is larger than the sum of its proper divisors (5416840645).
211102131323 is a wasteful number, since it uses less digits than its factorization.
211102131323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19277253.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 211102131323 its reverse (323131201112), we get a palindrome (534233332435).
The spelling of 211102131323 in words is "two hundred eleven billion, one hundred two million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •