Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …101100001011000000111111 |
3 | 112110012010100121210110212202 |
4 | 121003220302230023000333 |
5 | 103421013344024233043 |
6 | 1030213410215422115 |
7 | 32132524342530215 |
oct | 3103506254130077 |
9 | 473163317713782 |
10 | 110201121321023 |
11 | 32128040059487 |
12 | 1043987068493b |
13 | 4964bc89c7aa5 |
14 | 1d2da96d10cb5 |
15 | cb18b63301b8 |
hex | 643a32b0b03f |
110201121321023 has 2 divisors, whose sum is σ = 110201121321024. Its totient is φ = 110201121321022.
The previous prime is 110201121321017. The next prime is 110201121321089. The reversal of 110201121321023 is 320123121102011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110201121321023 - 216 = 110201121255487 is a prime.
It is a super-4 number, since 4×1102011213210234 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110201121320986 and 110201121321004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110201121321623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100560660511 + 55100560660512.
It is an arithmetic number, because the mean of its divisors is an integer number (55100560660512).
Almost surely, 2110201121321023 is an apocalyptic number.
110201121321023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201121321023 is an equidigital number, since it uses as much as digits as its factorization.
110201121321023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 110201121321023 its reverse (320123121102011), we get a palindrome (430324242423034).
The spelling of 110201121321023 in words is "one hundred ten trillion, two hundred one billion, one hundred twenty-one million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •