Base | Representation |
---|---|
bin | 110011000000100101111100… |
… | …001110110111001111101011 |
3 | 1002102022210121202101122221112 |
4 | 303000211330032313033223 |
5 | 213401101043411334201 |
6 | 2113044514511100535 |
7 | 65153052603354452 |
oct | 6300457416671753 |
9 | 1072283552348845 |
10 | 224341111043051 |
11 | 65533592694392 |
12 | 211b298821174b |
13 | 9824378498702 |
14 | 3d5824c2a5b99 |
15 | 1ae096188e0bb |
hex | cc097c3b73eb |
224341111043051 has 2 divisors, whose sum is σ = 224341111043052. Its totient is φ = 224341111043050.
The previous prime is 224341111043047. The next prime is 224341111043117. The reversal of 224341111043051 is 150340111143422.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 224341111043051 - 22 = 224341111043047 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 224341111042999 and 224341111043017.
It is not a weakly prime, because it can be changed into another prime (224341111043851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112170555521525 + 112170555521526.
It is an arithmetic number, because the mean of its divisors is an integer number (112170555521526).
Almost surely, 2224341111043051 is an apocalyptic number.
224341111043051 is a deficient number, since it is larger than the sum of its proper divisors (1).
224341111043051 is an equidigital number, since it uses as much as digits as its factorization.
224341111043051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 224341111043051 its reverse (150340111143422), we get a palindrome (374681222186473).
The spelling of 224341111043051 in words is "two hundred twenty-four trillion, three hundred forty-one billion, one hundred eleven million, forty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •