Base | Representation |
---|---|
bin | 100001001101001… |
… | …0110110011110111 |
3 | 2212122120111111211 |
4 | 1002122112303313 |
5 | 4240214033211 |
6 | 302321142251 |
7 | 36416406223 |
oct | 10232266367 |
9 | 2778514454 |
10 | 1114205431 |
11 | 521a38039 |
12 | 27118a987 |
13 | 149ab5771 |
14 | a7d99783 |
15 | 67c3ee21 |
hex | 42696cf7 |
1114205431 has 2 divisors, whose sum is σ = 1114205432. Its totient is φ = 1114205430.
The previous prime is 1114205413. The next prime is 1114205471. The reversal of 1114205431 is 1345024111.
Together with previous prime (1114205413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1114205431 - 213 = 1114197239 is a prime.
It is a super-2 number, since 2×11142054312 = 2482907484939791522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1114205401) 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, 557102715 + 557102716.
It is an arithmetic number, because the mean of its divisors is an integer number (557102716).
Almost surely, 21114205431 is an apocalyptic number.
1114205431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114205431 is an equidigital number, since it uses as much as digits as its factorization.
1114205431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 1114205431 is about 33379.7158615828. The cubic root of 1114205431 is about 1036.7047546285.
Adding to 1114205431 its reverse (1345024111), we get a palindrome (2459229542).
The spelling of 1114205431 in words is "one billion, one hundred fourteen million, two hundred five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •