Base | Representation |
---|---|
bin | 1101000100000100010… |
… | …1101001111111000111 |
3 | 210110021221012120101002 |
4 | 3101001011221333013 |
5 | 12134113124114002 |
6 | 251034000123515 |
7 | 22133410040504 |
oct | 3210105517707 |
9 | 713257176332 |
10 | 224430301127 |
11 | 871a906600a |
12 | 375b530659b |
13 | 18218808b66 |
14 | ac1092c4ab |
15 | 5c88112002 |
hex | 3441169fc7 |
224430301127 has 2 divisors, whose sum is σ = 224430301128. Its totient is φ = 224430301126.
The previous prime is 224430301091. The next prime is 224430301133. The reversal of 224430301127 is 721103034422.
224430301127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 224430301127 - 26 = 224430301063 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 224430301127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224430301427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112215150563 + 112215150564.
It is an arithmetic number, because the mean of its divisors is an integer number (112215150564).
Almost surely, 2224430301127 is an apocalyptic number.
224430301127 is a deficient number, since it is larger than the sum of its proper divisors (1).
224430301127 is an equidigital number, since it uses as much as digits as its factorization.
224430301127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 29.
Adding to 224430301127 its reverse (721103034422), we get a palindrome (945533335549).
The spelling of 224430301127 in words is "two hundred twenty-four billion, four hundred thirty million, three hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •