Base | Representation |
---|---|
bin | 1100011010100111111… |
… | …0110001101001110001 |
3 | 202101120121101001012022 |
4 | 3012221332301221301 |
5 | 11443322113001223 |
6 | 241554022441225 |
7 | 21260621212136 |
oct | 3065176615161 |
9 | 671517331168 |
10 | 213305203313 |
11 | 8250a2543a4 |
12 | 3540b593215 |
13 | 171649c1147 |
14 | a4771b658d |
15 | 58365b1ac8 |
hex | 31a9fb1a71 |
213305203313 has 4 divisors (see below), whose sum is σ = 213306220260. Its totient is φ = 213304186368.
The previous prime is 213305203303. The next prime is 213305203343. The reversal of 213305203313 is 313302503312.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 81777125089 + 131528078224 = 285967^2 + 362668^2 .
It is a cyclic number.
It is not a de Polignac number, because 213305203313 - 24 = 213305203297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213305203303) 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, 64808 + ... + 656361.
It is an arithmetic number, because the mean of its divisors is an integer number (53326555065).
Almost surely, 2213305203313 is an apocalyptic number.
It is an amenable number.
213305203313 is a deficient number, since it is larger than the sum of its proper divisors (1016947).
213305203313 is an equidigital number, since it uses as much as digits as its factorization.
213305203313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016946.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 213305203313 its reverse (313302503312), we get a palindrome (526607706625).
The spelling of 213305203313 in words is "two hundred thirteen billion, three hundred five million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •