Base | Representation |
---|---|
bin | 110000011101010101100111… |
… | …101101010011001010001110 |
3 | 1000221121021221100222012212100 |
4 | 300131111213231103022032 |
5 | 210413243443400414042 |
6 | 2033135012155215530 |
7 | 62614402400064111 |
oct | 6035254755231216 |
9 | 1027537840865770 |
10 | 213122312123022 |
11 | 619a8735119435 |
12 | 1baa06471475a6 |
13 | 91bc46a15c793 |
14 | 3a8b264098578 |
15 | 1998c0169524c |
hex | c1d567b5328e |
213122312123022 has 48 divisors (see below), whose sum is σ = 464723799321600. Its totient is φ = 70586554387536.
The previous prime is 213122312122963. The next prime is 213122312123033. The reversal of 213122312123022 is 220321213221312.
213122312123022 is a `hidden beast` number, since 2 + 1 + 31 + 2 + 2 + 312 + 12 + 302 + 2 = 666.
It is a super-2 number, since 2×2131223121230222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38316198 + ... + 43524425.
It is an arithmetic number, because the mean of its divisors is an integer number (9681745819200).
Almost surely, 2213122312123022 is an apocalyptic number.
213122312123022 is an abundant number, since it is smaller than the sum of its proper divisors (251601487198578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213122312123022 is a wasteful number, since it uses less digits than its factorization.
213122312123022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81841557 (or 81841554 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 213122312123022 its reverse (220321213221312), we get a palindrome (433443525344334).
The spelling of 213122312123022 in words is "two hundred thirteen trillion, one hundred twenty-two billion, three hundred twelve million, one hundred twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •