Base | Representation |
---|---|
bin | 1001001001010101100101… |
… | …01001111010110101100111 |
3 | 2122012200200020121012222022 |
4 | 10210222302221322311213 |
5 | 10114003421224310343 |
6 | 110435201352053355 |
7 | 4144021646101061 |
oct | 444526251726547 |
9 | 78180606535868 |
10 | 20112034213223 |
11 | 6454513aa26a7 |
12 | 2309a1b69425b |
13 | b2b7310768b4 |
14 | 4d75db684731 |
15 | 24d26084d568 |
hex | 124ab2a7ad67 |
20112034213223 has 8 divisors (see below), whose sum is σ = 20255350460976. Its totient is φ = 19969170782400.
The previous prime is 20112034213163. The next prime is 20112034213339. The reversal of 20112034213223 is 32231243021102.
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 20112034213223 - 234 = 20094854344039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112034213192 and 20112034213201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112034210223) 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, 113115086 + ... + 113292747.
It is an arithmetic number, because the mean of its divisors is an integer number (2531918807622).
Almost surely, 220112034213223 is an apocalyptic number.
20112034213223 is a deficient number, since it is larger than the sum of its proper divisors (143316247753).
20112034213223 is a wasteful number, since it uses less digits than its factorization.
20112034213223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226408465.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 20112034213223 its reverse (32231243021102), we get a palindrome (52343277234325).
The spelling of 20112034213223 in words is "twenty trillion, one hundred twelve billion, thirty-four million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •