Base | Representation |
---|---|
bin | 110011010001011110… |
… | …0101100101000011001 |
3 | 101112012121122002102022 |
4 | 1212202330230220121 |
5 | 3301000122042331 |
6 | 122325524344225 |
7 | 10645402403354 |
oct | 1464274545031 |
9 | 345177562368 |
10 | 110108002841 |
11 | 42773108261 |
12 | 1940ab45075 |
13 | a4c99b3205 |
14 | 548769929b |
15 | 2ce682d67b |
hex | 19a2f2ca19 |
110108002841 has 2 divisors, whose sum is σ = 110108002842. Its totient is φ = 110108002840.
The previous prime is 110108002813. The next prime is 110108002859. The reversal of 110108002841 is 148200801011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91821120400 + 18286882441 = 303020^2 + 135229^2 .
It is an emirp because it is prime and its reverse (148200801011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110108002841 - 26 = 110108002777 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110108002841.
It is not a weakly prime, because it can be changed into another prime (110108002871) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55054001420 + 55054001421.
It is an arithmetic number, because the mean of its divisors is an integer number (55054001421).
Almost surely, 2110108002841 is an apocalyptic number.
It is an amenable number.
110108002841 is a deficient number, since it is larger than the sum of its proper divisors (1).
110108002841 is an equidigital number, since it uses as much as digits as its factorization.
110108002841 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 26.
Adding to 110108002841 its reverse (148200801011), we get a palindrome (258308803852).
The spelling of 110108002841 in words is "one hundred ten billion, one hundred eight million, two thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •