Base | Representation |
---|---|
bin | 110000100000010000100001… |
… | …101010010101100011101001 |
3 | 1000222022110221200101012122021 |
4 | 300200100201222111203221 |
5 | 210430041001100413301 |
6 | 2033411122233424441 |
7 | 62635035546243562 |
oct | 6040204152254351 |
9 | 1028273850335567 |
10 | 213323000404201 |
11 | 61a7585a455456 |
12 | 1bb1351526b121 |
13 | 9205370c4700c |
14 | 3a96c61743169 |
15 | 199e04a2748a1 |
hex | c20421a958e9 |
213323000404201 has 4 divisors (see below), whose sum is σ = 213594058855312. Its totient is φ = 213051941953092.
The previous prime is 213323000404187. The next prime is 213323000404231. The reversal of 213323000404201 is 102404000323312.
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 a cyclic number.
It is not a de Polignac number, because 213323000404201 - 25 = 213323000404169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213323000404231) 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, 135529224375 + ... + 135529225948.
It is an arithmetic number, because the mean of its divisors is an integer number (53398514713828).
Almost surely, 2213323000404201 is an apocalyptic number.
It is an amenable number.
213323000404201 is a deficient number, since it is larger than the sum of its proper divisors (271058451111).
213323000404201 is an equidigital number, since it uses as much as digits as its factorization.
213323000404201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271058451110.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 213323000404201 its reverse (102404000323312), we get a palindrome (315727000727513).
The spelling of 213323000404201 in words is "two hundred thirteen trillion, three hundred twenty-three billion, four hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •