Base | Representation |
---|---|
bin | 11001000001000000100000… |
… | …000100001110101101111111 |
3 | 112102112211221020211011012011 |
4 | 121001000200010032231333 |
5 | 103410033310034442421 |
6 | 1025554403332152051 |
7 | 32113466401611022 |
oct | 3101004004165577 |
9 | 472484836734164 |
10 | 110020420234111 |
11 | 32068441aa5332 |
12 | 1040a840168627 |
13 | 4950b5ba5351a |
14 | 1d25033d771b9 |
15 | cabd3c2dc4e1 |
hex | 64102010eb7f |
110020420234111 has 2 divisors, whose sum is σ = 110020420234112. Its totient is φ = 110020420234110.
The previous prime is 110020420234073. The next prime is 110020420234159. The reversal of 110020420234111 is 111432024020011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110020420234111 - 223 = 110020411845503 is a prime.
It is a super-2 number, since 2×1100204202341112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110020420238111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010210117055 + 55010210117056.
It is an arithmetic number, because the mean of its divisors is an integer number (55010210117056).
Almost surely, 2110020420234111 is an apocalyptic number.
110020420234111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020420234111 is an equidigital number, since it uses as much as digits as its factorization.
110020420234111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 110020420234111 its reverse (111432024020011), we get a palindrome (221452444254122).
The spelling of 110020420234111 in words is "one hundred ten trillion, twenty billion, four hundred twenty million, two hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •