Base | Representation |
---|---|
bin | 1100011010100111011… |
… | …0110101100100110111 |
3 | 202101120110110022111012 |
4 | 3012221312311210313 |
5 | 11443321044402411 |
6 | 241553510102435 |
7 | 21260564423633 |
oct | 3065166654467 |
9 | 671513408435 |
10 | 213303122231 |
11 | 825090628a1 |
12 | 3540a94aa1b |
13 | 17164442b34 |
14 | a476bd3dc3 |
15 | 583630018b |
hex | 31a9db5937 |
213303122231 has 4 divisors (see below), whose sum is σ = 213336348264. Its totient is φ = 213269896200.
The previous prime is 213303122191. The next prime is 213303122327. The reversal of 213303122231 is 132221303312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213303122231 - 26 = 213303122167 is a prime.
It is a super-2 number, since 2×2133031222312 (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 = 213303122197 and 213303122206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213303122531) 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, 16603385 + ... + 16616226.
It is an arithmetic number, because the mean of its divisors is an integer number (53334087066).
Almost surely, 2213303122231 is an apocalyptic number.
213303122231 is a deficient number, since it is larger than the sum of its proper divisors (33226033).
213303122231 is an equidigital number, since it uses as much as digits as its factorization.
213303122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33226032.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 213303122231 its reverse (132221303312), we get a palindrome (345524425543).
The spelling of 213303122231 in words is "two hundred thirteen billion, three hundred three million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •