Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …011010010010101100000001 |
3 | 112120002102022120112010221000 |
4 | 121033203202122102230001 |
5 | 104022423142440210423 |
6 | 1032041534054122213 |
7 | 32245636620654252 |
oct | 3117434232225401 |
9 | 476072276463830 |
10 | 111020113210113 |
11 | 32413402689588 |
12 | 10550537350369 |
13 | 49c41c8532153 |
14 | 1d5b58b6dcb29 |
15 | cc7d4bb08843 |
hex | 64f8e2692b01 |
111020113210113 has 8 divisors (see below), whose sum is σ = 164474241792800. Its totient is φ = 74013408806724.
The previous prime is 111020113210103. The next prime is 111020113210117. The reversal of 111020113210113 is 311012311020111.
It is not a de Polignac number, because 111020113210113 - 28 = 111020113209857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111020113210117) 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, 2055928022383 + ... + 2055928022436.
It is an arithmetic number, because the mean of its divisors is an integer number (20559280224100).
Almost surely, 2111020113210113 is an apocalyptic number.
It is an amenable number.
111020113210113 is a deficient number, since it is larger than the sum of its proper divisors (53454128582687).
111020113210113 is an equidigital number, since it uses as much as digits as its factorization.
111020113210113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4111856044828 (or 4111856044822 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 111020113210113 its reverse (311012311020111), we get a palindrome (422032424230224).
The spelling of 111020113210113 in words is "one hundred eleven trillion, twenty billion, one hundred thirteen million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •