Base | Representation |
---|---|
bin | 10011000010110011… |
… | …01011000011111001 |
3 | 222101112100210010222 |
4 | 21201121223003321 |
5 | 131414324221041 |
6 | 4410304545425 |
7 | 511235013062 |
oct | 114131530371 |
9 | 28345323128 |
10 | 10224054521 |
11 | 437723753a |
12 | 1b94022275 |
13 | c6c247505 |
14 | 6cdc07569 |
15 | 3ec8b974b |
hex | 26166b0f9 |
10224054521 has 2 divisors, whose sum is σ = 10224054522. Its totient is φ = 10224054520.
The previous prime is 10224054499. The next prime is 10224054557. The reversal of 10224054521 is 12545042201.
10224054521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9880360000 + 343694521 = 99400^2 + 18539^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10224054521 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10224054821) 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, 5112027260 + 5112027261.
It is an arithmetic number, because the mean of its divisors is an integer number (5112027261).
Almost surely, 210224054521 is an apocalyptic number.
It is an amenable number.
10224054521 is a deficient number, since it is larger than the sum of its proper divisors (1).
10224054521 is an equidigital number, since it uses as much as digits as its factorization.
10224054521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3200, while the sum is 26.
Adding to 10224054521 its reverse (12545042201), we get a palindrome (22769096722).
The spelling of 10224054521 in words is "ten billion, two hundred twenty-four million, fifty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •