Base | Representation |
---|---|
bin | 1001001001010101100100… |
… | …11010010001011001011011 |
3 | 2122012200122221212211020002 |
4 | 10210222302122101121123 |
5 | 10114003414202030243 |
6 | 110435201124123215 |
7 | 4144021566165143 |
oct | 444526232213133 |
9 | 78180587784202 |
10 | 20112030111323 |
11 | 64545117508a7 |
12 | 2309a1a23650b |
13 | b2b73026b837 |
14 | 4d75dacd7923 |
15 | 24d2602dceb8 |
hex | 124ab269165b |
20112030111323 has 8 divisors (see below), whose sum is σ = 20401910239680. Its totient is φ = 19823032419840.
The previous prime is 20112030111293. The next prime is 20112030111389. The reversal of 20112030111323 is 32311103021102.
It is a happy number.
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 20112030111323 - 230 = 20110956369499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112030111295 and 20112030111304.
It is not an unprimeable number, because it can be changed into a prime (20112030111223) 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, 220563308 + ... + 220654473.
It is an arithmetic number, because the mean of its divisors is an integer number (2550238779960).
Almost surely, 220112030111323 is an apocalyptic number.
20112030111323 is a deficient number, since it is larger than the sum of its proper divisors (289880128357).
20112030111323 is an equidigital number, since it uses as much as digits as its factorization.
20112030111323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441218437.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20112030111323 its reverse (32311103021102), we get a palindrome (52423133132425).
The spelling of 20112030111323 in words is "twenty trillion, one hundred twelve billion, thirty million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •