Base | Representation |
---|---|
bin | 11001000000110111101110… |
… | …101000101101000001101001 |
3 | 112102111221121210212111011001 |
4 | 121000313232220231001221 |
5 | 103404410012224000131 |
6 | 1025550204533235001 |
7 | 32113014105466141 |
oct | 3100675650550151 |
9 | 472457553774131 |
10 | 110011001000041 |
11 | 320644490a1369 |
12 | 10408a51792a61 |
13 | 494ccba48903b |
14 | 1d247bcdd1921 |
15 | cab98a3ed261 |
hex | 640deea2d069 |
110011001000041 has 2 divisors, whose sum is σ = 110011001000042. Its totient is φ = 110011001000040.
The previous prime is 110011001000011. The next prime is 110011001000111. The reversal of 110011001000041 is 140000100110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105536172686400 + 4474828313641 = 10273080^2 + 2115379^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110011001000041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011000999991 and 110011001000027.
It is not a weakly prime, because it can be changed into another prime (110011001000011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005500500020 + 55005500500021.
It is an arithmetic number, because the mean of its divisors is an integer number (55005500500021).
Almost surely, 2110011001000041 is an apocalyptic number.
It is an amenable number.
110011001000041 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011001000041 is an equidigital number, since it uses as much as digits as its factorization.
110011001000041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110011001000041 its reverse (140000100110011), we get a palindrome (250011101110052).
The spelling of 110011001000041 in words is "one hundred ten trillion, eleven billion, one million, forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •