Base | Representation |
---|---|
bin | 110000011101001010100001… |
… | …101101010110101101101111 |
3 | 1000221120011012012210122002200 |
4 | 300131022201231112231233 |
5 | 210413100044440023343 |
6 | 2033125322155552543 |
7 | 62613501246300426 |
oct | 6035124155265557 |
9 | 1027504165718080 |
10 | 213110400314223 |
11 | 619a3682223155 |
12 | 1ba9a281a5b753 |
13 | 91bb2bc3657c9 |
14 | 3a8a8540762bd |
15 | 1998755a454d3 |
hex | c1d2a1b56b6f |
213110400314223 has 12 divisors (see below), whose sum is σ = 314984881085160. Its totient is φ = 138769562995056.
The previous prime is 213110400314131. The next prime is 213110400314257. The reversal of 213110400314223 is 322413004011312.
213110400314223 is a `hidden beast` number, since 2 + 1 + 3 + 1 + 1 + 0 + 400 + 31 + 4 + 223 = 666.
It is not a de Polignac number, because 213110400314223 - 210 = 213110400313199 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213110400315223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 275336434128 + ... + 275336434901.
It is an arithmetic number, because the mean of its divisors is an integer number (26248740090430).
Almost surely, 2213110400314223 is an apocalyptic number.
213110400314223 is a deficient number, since it is larger than the sum of its proper divisors (101874480770937).
213110400314223 is a wasteful number, since it uses less digits than its factorization.
213110400314223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550672869078 (or 550672869075 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 213110400314223 its reverse (322413004011312), we get a palindrome (535523404325535).
The spelling of 213110400314223 in words is "two hundred thirteen trillion, one hundred ten billion, four hundred million, three hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •