Base | Representation |
---|---|
bin | 111100110101001… |
… | …1000011011100101 |
3 | 12021020210022212122 |
4 | 1321222120123211 |
5 | 13140013401003 |
6 | 534312555325 |
7 | 101403342056 |
oct | 17152303345 |
9 | 5236708778 |
10 | 2041153253 |
11 | 9581a5717 |
12 | 48b6b2b45 |
13 | 266b55ab9 |
14 | 15512c72d |
15 | be2e1238 |
hex | 79a986e5 |
2041153253 has 2 divisors, whose sum is σ = 2041153254. Its totient is φ = 2041153252.
The previous prime is 2041153241. The next prime is 2041153259. The reversal of 2041153253 is 3523511402.
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., 1932305764 + 108847489 = 43958^2 + 10433^2 .
It is a cyclic number.
It is not a de Polignac number, because 2041153253 - 210 = 2041152229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2041153259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1020576626 + 1020576627.
It is an arithmetic number, because the mean of its divisors is an integer number (1020576627).
Almost surely, 22041153253 is an apocalyptic number.
It is an amenable number.
2041153253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2041153253 is an equidigital number, since it uses as much as digits as its factorization.
2041153253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 2041153253 is about 45179.1240840280. The cubic root of 2041153253 is about 1268.5040879801.
Adding to 2041153253 its reverse (3523511402), we get a palindrome (5564664655).
The spelling of 2041153253 in words is "two billion, forty-one million, one hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •