Base | Representation |
---|---|
bin | 1100010011010001000… |
… | …0110001100110110111 |
3 | 202012110222002000000101 |
4 | 3010310100301212313 |
5 | 11430301013211411 |
6 | 241030031454531 |
7 | 21160650101620 |
oct | 3046420614667 |
9 | 665428060011 |
10 | 211330210231 |
11 | 81696437908 |
12 | 34b5a087447 |
13 | 16c0b79119a |
14 | a32ab8aa47 |
15 | 576cedd8c1 |
hex | 31344319b7 |
211330210231 has 8 divisors (see below), whose sum is σ = 241594375040. Its totient is φ = 181084579128.
The previous prime is 211330210187. The next prime is 211330210309. The reversal of 211330210231 is 132012033112.
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 211330210231 - 221 = 211328113079 is a prime.
It is a super-2 number, since 2×2113302102312 (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 = 211330210199 and 211330210208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211330213231) 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, 4608981 + ... + 4654606.
It is an arithmetic number, because the mean of its divisors is an integer number (30199296880).
Almost surely, 2211330210231 is an apocalyptic number.
211330210231 is a deficient number, since it is larger than the sum of its proper divisors (30264164809).
211330210231 is an equidigital number, since it uses as much as digits as its factorization.
211330210231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9266853.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 211330210231 its reverse (132012033112), we get a palindrome (343342243343).
The spelling of 211330210231 in words is "two hundred eleven billion, three hundred thirty million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.304 sec. • engine limits •