Base | Representation |
---|---|
bin | 110011000110001011100001… |
… | …100111100111101100101101 |
3 | 1002110200111200002211221100221 |
4 | 303012023201213213230231 |
5 | 213423343412403334013 |
6 | 2113541134054051341 |
7 | 65222564403600532 |
oct | 6306134147475455 |
9 | 1073614602757327 |
10 | 224725064121133 |
11 | 65671401142844 |
12 | 21255281349b51 |
13 | 9851637402484 |
14 | 3d6ca731a0d89 |
15 | 1aea9345c408d |
hex | cc62e19e7b2d |
224725064121133 has 2 divisors, whose sum is σ = 224725064121134. Its totient is φ = 224725064121132.
The previous prime is 224725064121119. The next prime is 224725064121137. The reversal of 224725064121133 is 331121460527422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138659032477449 + 86066031643684 = 11775357^2 + 9277178^2 .
It is a cyclic number.
It is not a de Polignac number, because 224725064121133 - 229 = 224724527250221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 224725064121133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224725064121137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112362532060566 + 112362532060567.
It is an arithmetic number, because the mean of its divisors is an integer number (112362532060567).
Almost surely, 2224725064121133 is an apocalyptic number.
It is an amenable number.
224725064121133 is a deficient number, since it is larger than the sum of its proper divisors (1).
224725064121133 is an equidigital number, since it uses as much as digits as its factorization.
224725064121133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 224725064121133 in words is "two hundred twenty-four trillion, seven hundred twenty-five billion, sixty-four million, one hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •