Base | Representation |
---|---|
bin | 110000100000000110100100… |
… | …000011011010100010110101 |
3 | 1000222021110100011112120202111 |
4 | 300200012210003122202311 |
5 | 210424402044044130141 |
6 | 2033402152541411021 |
7 | 62634206503626040 |
oct | 6040064403324265 |
9 | 1028243304476674 |
10 | 213312303114421 |
11 | 61a712700822a5 |
12 | 1bb1142a869a71 |
13 | 9204357958c54 |
14 | 3a96528b4dc57 |
15 | 199db2107c381 |
hex | c201a40da8b5 |
213312303114421 has 8 divisors (see below), whose sum is σ = 246063858333120. Its totient is φ = 181130340160608.
The previous prime is 213312303114389. The next prime is 213312303114439. The reversal of 213312303114421 is 124411303213312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213312303114421 - 25 = 213312303114389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213312303114221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142398065416 + ... + 142398066913.
It is an arithmetic number, because the mean of its divisors is an integer number (30757982291640).
Almost surely, 2213312303114421 is an apocalyptic number.
It is an amenable number.
213312303114421 is a deficient number, since it is larger than the sum of its proper divisors (32751555218699).
213312303114421 is a wasteful number, since it uses less digits than its factorization.
213312303114421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284796132443.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 213312303114421 its reverse (124411303213312), we get a palindrome (337723606327733).
The spelling of 213312303114421 in words is "two hundred thirteen trillion, three hundred twelve billion, three hundred three million, one hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •