Base | Representation |
---|---|
bin | 100000100111001110111… |
… | …010101100111010110101 |
3 | 21221020210120002111020101 |
4 | 200213032322230322311 |
5 | 243204333230043203 |
6 | 4433323030434101 |
7 | 320626526026504 |
oct | 40471672547265 |
9 | 7836716074211 |
10 | 2241149456053 |
11 | 794514494402 |
12 | 302424502931 |
13 | 133454b113c1 |
14 | 7a687a7283b |
15 | 3d46dcdd41d |
hex | 209ceeaceb5 |
2241149456053 has 2 divisors, whose sum is σ = 2241149456054. Its totient is φ = 2241149456052.
The previous prime is 2241149456023. The next prime is 2241149456081. The reversal of 2241149456053 is 3506549411422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1906779863044 + 334369593009 = 1380862^2 + 578247^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2241149456053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2241149455994 and 2241149456012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2241149456023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1120574728026 + 1120574728027.
It is an arithmetic number, because the mean of its divisors is an integer number (1120574728027).
Almost surely, 22241149456053 is an apocalyptic number.
It is an amenable number.
2241149456053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2241149456053 is an equidigital number, since it uses as much as digits as its factorization.
2241149456053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 2241149456053 in words is "two trillion, two hundred forty-one billion, one hundred forty-nine million, four hundred fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •