Base | Representation |
---|---|
bin | 110000011011101000110110… |
… | …111100111111010000000011 |
3 | 1000221012010111121212111000112 |
4 | 300123220312330333100003 |
5 | 210404340311142111303 |
6 | 2033005220053541535 |
7 | 62603066413523633 |
oct | 6033506674772003 |
9 | 1027163447774015 |
10 | 213005530035203 |
11 | 61963157731374 |
12 | 1ba81a950448ab |
13 | 91b1448845c79 |
14 | 3a857462806c3 |
15 | 1995b68e7a0d8 |
hex | c1ba36f3f403 |
213005530035203 has 4 divisors (see below), whose sum is σ = 213005671637640. Its totient is φ = 213005388432768.
The previous prime is 213005530035173. The next prime is 213005530035247. The reversal of 213005530035203 is 302530035500312.
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 213005530035203 - 210 = 213005530034179 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 213005530035203.
It is not an unprimeable number, because it can be changed into a prime (213005530035703) 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, 68520350 + ... + 71561507.
It is an arithmetic number, because the mean of its divisors is an integer number (53251417909410).
Almost surely, 2213005530035203 is an apocalyptic number.
213005530035203 is a deficient number, since it is larger than the sum of its proper divisors (141602437).
213005530035203 is a wasteful number, since it uses less digits than its factorization.
213005530035203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141602436.
The product of its (nonzero) digits is 40500, while the sum is 32.
Adding to 213005530035203 its reverse (302530035500312), we get a palindrome (515535565535515).
The spelling of 213005530035203 in words is "two hundred thirteen trillion, five billion, five hundred thirty million, thirty-five thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •