Base | Representation |
---|---|
bin | 1111001111101000… |
… | …1000110111001101 |
3 | 101120012000102120122 |
4 | 3303322020313031 |
5 | 31340034313031 |
6 | 1514015554325 |
7 | 203256211526 |
oct | 36372106715 |
9 | 11505012518 |
10 | 4092104141 |
11 | 180a982454 |
12 | 96252b9a5 |
13 | 502a2c2c8 |
14 | 2ab68b84d |
15 | 18e3ba47b |
hex | f3e88dcd |
4092104141 has 2 divisors, whose sum is σ = 4092104142. Its totient is φ = 4092104140.
The previous prime is 4092104111. The next prime is 4092104161. The reversal of 4092104141 is 1414012904.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3510088516 + 582015625 = 59246^2 + 24125^2 .
It is a cyclic number.
It is not a de Polignac number, because 4092104141 - 210 = 4092103117 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 4092104141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4092104111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2046052070 + 2046052071.
It is an arithmetic number, because the mean of its divisors is an integer number (2046052071).
Almost surely, 24092104141 is an apocalyptic number.
It is an amenable number.
4092104141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4092104141 is an equidigital number, since it uses as much as digits as its factorization.
4092104141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 4092104141 is about 63969.5563608190. The cubic root of 4092104141 is about 1599.4925657788.
The spelling of 4092104141 in words is "four billion, ninety-two million, one hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •