Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …011110000101100010100001 |
3 | 112102211110121102010211012111 |
4 | 121002022231132011202201 |
5 | 103412340002103323131 |
6 | 1030055142201155321 |
7 | 32122320110544412 |
oct | 3102125536054241 |
9 | 472743542124174 |
10 | 110100102011041 |
11 | 3209921131073a |
12 | 1042217948bb41 |
13 | 4958519c79b5c |
14 | 1d28c32757809 |
15 | cade5289cab1 |
hex | 6422ad7858a1 |
110100102011041 has 2 divisors, whose sum is σ = 110100102011042. Its totient is φ = 110100102011040.
The previous prime is 110100102011027. The next prime is 110100102011101. The reversal of 110100102011041 is 140110201001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101110988716816 + 8989113294225 = 10055396^2 + 2998185^2 .
It is an emirp because it is prime and its reverse (140110201001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110100102011041 - 223 = 110100093622433 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100102011741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050051005520 + 55050051005521.
It is an arithmetic number, because the mean of its divisors is an integer number (55050051005521).
Almost surely, 2110100102011041 is an apocalyptic number.
It is an amenable number.
110100102011041 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100102011041 is an equidigital number, since it uses as much as digits as its factorization.
110100102011041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110100102011041 its reverse (140110201001011), we get a palindrome (250210303012052).
The spelling of 110100102011041 in words is "one hundred ten trillion, one hundred billion, one hundred two million, eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •