Base | Representation |
---|---|
bin | 110000011101010100100110… |
… | …110011000000111111001100 |
3 | 1000221121012010110210020102200 |
4 | 300131110212303000333030 |
5 | 210413234231103234122 |
6 | 2033134312133521500 |
7 | 62614333404416652 |
oct | 6035244663007714 |
9 | 1027535113706380 |
10 | 213121223102412 |
11 | 619a82264230a9 |
12 | 1baa03a24a3290 |
13 | 91bc3256543a1 |
14 | 3a8b19d5b6dd2 |
15 | 1998b8ac7c5ac |
hex | c1d526cc0fcc |
213121223102412 has 72 divisors (see below), whose sum is σ = 570427228478016. Its totient is φ = 66859855501824.
The previous prime is 213121223102357. The next prime is 213121223102441. The reversal of 213121223102412 is 214201322121312.
213121223102412 is a `hidden beast` number, since 2 + 1 + 3 + 1 + 2 + 12 + 231 + 0 + 2 + 412 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19691373 + ... + 28530555.
It is an arithmetic number, because the mean of its divisors is an integer number (7922600395528).
Almost surely, 2213121223102412 is an apocalyptic number.
It is an amenable number.
213121223102412 is an abundant number, since it is smaller than the sum of its proper divisors (357306005375604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213121223102412 is a wasteful number, since it uses less digits than its factorization.
213121223102412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8878607 (or 8878602 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 213121223102412 its reverse (214201322121312), we get a palindrome (427322545223724).
The spelling of 213121223102412 in words is "two hundred thirteen trillion, one hundred twenty-one billion, two hundred twenty-three million, one hundred two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •