Base | Representation |
---|---|
bin | 11001000001000000010101… |
… | …100000100110100010010011 |
3 | 112102112211110220112221111022 |
4 | 121001000111200212202103 |
5 | 103410032424214403243 |
6 | 1025554334004110055 |
7 | 32113462121312102 |
oct | 3101002540464223 |
9 | 472484426487438 |
10 | 110020243122323 |
11 | 32068361025656 |
12 | 1040a7b099532b |
13 | 4950b31151151 |
14 | 1d25018632039 |
15 | cabd2b9a4b68 |
hex | 641015826893 |
110020243122323 has 2 divisors, whose sum is σ = 110020243122324. Its totient is φ = 110020243122322.
The previous prime is 110020243122313. The next prime is 110020243122371. The reversal of 110020243122323 is 323221342020011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110020243122323 - 28 = 110020243122067 is a prime.
It is a super-2 number, since 2×1100202431223232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110020243122292 and 110020243122301.
It is not a weakly prime, because it can be changed into another prime (110020243122313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010121561161 + 55010121561162.
It is an arithmetic number, because the mean of its divisors is an integer number (55010121561162).
Almost surely, 2110020243122323 is an apocalyptic number.
110020243122323 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020243122323 is an equidigital number, since it uses as much as digits as its factorization.
110020243122323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 110020243122323 its reverse (323221342020011), we get a palindrome (433241585142334).
The spelling of 110020243122323 in words is "one hundred ten trillion, twenty billion, two hundred forty-three million, one hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •