Base | Representation |
---|---|
bin | 1010001101010100101111… |
… | …0000000011000110011001 |
3 | 1110202000011021121200220221 |
4 | 2203111023300003012121 |
5 | 2432343243212300012 |
6 | 35512124354520041 |
7 | 2235623455344214 |
oct | 243251360030631 |
9 | 43660137550827 |
10 | 11224020431257 |
11 | 3638097a18697 |
12 | 1313359896021 |
13 | 63556104405a |
14 | 2ab36189077b |
15 | 146e68808507 |
hex | a354bc03199 |
11224020431257 has 2 divisors, whose sum is σ = 11224020431258. Its totient is φ = 11224020431256.
The previous prime is 11224020431249. The next prime is 11224020431317. The reversal of 11224020431257 is 75213402042211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7051250065561 + 4172770365696 = 2655419^2 + 2042736^2 .
It is a cyclic number.
It is not a de Polignac number, because 11224020431257 - 23 = 11224020431249 is a prime.
It is not a weakly prime, because it can be changed into another prime (11224020431357) 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, 5612010215628 + 5612010215629.
It is an arithmetic number, because the mean of its divisors is an integer number (5612010215629).
Almost surely, 211224020431257 is an apocalyptic number.
It is an amenable number.
11224020431257 is a deficient number, since it is larger than the sum of its proper divisors (1).
11224020431257 is an equidigital number, since it uses as much as digits as its factorization.
11224020431257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26880, while the sum is 34.
Adding to 11224020431257 its reverse (75213402042211), we get a palindrome (86437422473468).
The spelling of 11224020431257 in words is "eleven trillion, two hundred twenty-four billion, twenty million, four hundred thirty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •