Base | Representation |
---|---|
bin | 1000010110000110… |
… | …0001000110001001 |
3 | 12210010020201101021 |
4 | 2011201201012021 |
5 | 14041434443131 |
6 | 1010142152441 |
7 | 106341004114 |
oct | 20541410611 |
9 | 5703221337 |
10 | 2240156041 |
11 | a4a567432 |
12 | 526282721 |
13 | 299151226 |
14 | 17373157b |
15 | d19eee11 |
hex | 85861189 |
2240156041 has 2 divisors, whose sum is σ = 2240156042. Its totient is φ = 2240156040.
The previous prime is 2240156021. The next prime is 2240156053. The reversal of 2240156041 is 1406510422.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1764000000 + 476156041 = 42000^2 + 21821^2 .
It is a cyclic number.
It is not a de Polignac number, because 2240156041 - 29 = 2240155529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2240155997 and 2240156015.
It is not a weakly prime, because it can be changed into another prime (2240156021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1120078020 + 1120078021.
It is an arithmetic number, because the mean of its divisors is an integer number (1120078021).
Almost surely, 22240156041 is an apocalyptic number.
It is an amenable number.
2240156041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2240156041 is an equidigital number, since it uses as much as digits as its factorization.
2240156041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 2240156041 is about 47330.2867200274. The cubic root of 2240156041 is about 1308.4569055401.
Adding to 2240156041 its reverse (1406510422), we get a palindrome (3646666463).
The spelling of 2240156041 in words is "two billion, two hundred forty million, one hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •