Base | Representation |
---|---|
bin | 1101000010100101001… |
… | …0011100101000100001 |
3 | 210102021002212000201222 |
4 | 3100221102130220201 |
5 | 12132303414013441 |
6 | 250530213504425 |
7 | 22120461042524 |
oct | 3205122345041 |
9 | 712232760658 |
10 | 224031001121 |
11 | 87013729004 |
12 | 37503642115 |
13 | 18183b81075 |
14 | abb38aabbb |
15 | 5c6303ad4b |
hex | 342949ca21 |
224031001121 has 2 divisors, whose sum is σ = 224031001122. Its totient is φ = 224031001120.
The previous prime is 224031001109. The next prime is 224031001133. The reversal of 224031001121 is 121100130422.
It is a balanced prime because it is at equal distance from previous prime (224031001109) and next prime (224031001133).
It can be written as a sum of positive squares in only one way, i.e., 151581742225 + 72449258896 = 389335^2 + 269164^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-224031001121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 224031001121.
It is not a weakly prime, because it can be changed into another prime (224031001141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112015500560 + 112015500561.
It is an arithmetic number, because the mean of its divisors is an integer number (112015500561).
Almost surely, 2224031001121 is an apocalyptic number.
It is an amenable number.
224031001121 is a deficient number, since it is larger than the sum of its proper divisors (1).
224031001121 is an equidigital number, since it uses as much as digits as its factorization.
224031001121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 224031001121 its reverse (121100130422), we get a palindrome (345131131543).
The spelling of 224031001121 in words is "two hundred twenty-four billion, thirty-one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •