Base | Representation |
---|---|
bin | 1100011010101001010… |
… | …0111001111000110101 |
3 | 202101121000021202112110 |
4 | 3012222110321320311 |
5 | 11443330104113323 |
6 | 241554351041233 |
7 | 21261021422316 |
oct | 3065224717065 |
9 | 671530252473 |
10 | 213311004213 |
11 | 8251255672a |
12 | 35411510219 |
13 | 17165c72628 |
14 | a477c8660d |
15 | 5836d5a793 |
hex | 31aa539e35 |
213311004213 has 4 divisors (see below), whose sum is σ = 284414672288. Its totient is φ = 142207336140.
The previous prime is 213311004167. The next prime is 213311004233. The reversal of 213311004213 is 312400113312.
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 not a de Polignac number, because 213311004213 - 29 = 213311003701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213311004213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213311004233) 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, 35551834033 + ... + 35551834038.
It is an arithmetic number, because the mean of its divisors is an integer number (71103668072).
Almost surely, 2213311004213 is an apocalyptic number.
It is an amenable number.
213311004213 is a deficient number, since it is larger than the sum of its proper divisors (71103668075).
213311004213 is an equidigital number, since it uses as much as digits as its factorization.
213311004213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71103668074.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 213311004213 its reverse (312400113312), we get a palindrome (525711117525).
The spelling of 213311004213 in words is "two hundred thirteen billion, three hundred eleven million, four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •