Base | Representation |
---|---|
bin | 100111011001110… |
… | …0100001101110011 |
3 | 10102010211200211211 |
4 | 1032303210031303 |
5 | 10201431444111 |
6 | 335110020551 |
7 | 44523003055 |
oct | 11663441563 |
9 | 3363750754 |
10 | 1322140531 |
11 | 61934a828 |
12 | 30a947757 |
13 | 180bba79a |
14 | c78458d5 |
15 | 7b115521 |
hex | 4ece4373 |
1322140531 has 2 divisors, whose sum is σ = 1322140532. Its totient is φ = 1322140530.
The previous prime is 1322140513. The next prime is 1322140543. The reversal of 1322140531 is 1350412231.
It is a happy number.
Together with previous prime (1322140513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1322140531 - 29 = 1322140019 is a prime.
It is a super-2 number, since 2×13221405312 = 3496111167425923922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1322140511) 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, 661070265 + 661070266.
It is an arithmetic number, because the mean of its divisors is an integer number (661070266).
Almost surely, 21322140531 is an apocalyptic number.
1322140531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322140531 is an equidigital number, since it uses as much as digits as its factorization.
1322140531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 1322140531 is about 36361.2504047922. The cubic root of 1322140531 is about 1097.5539396801.
Adding to 1322140531 its reverse (1350412231), we get a palindrome (2672552762).
The spelling of 1322140531 in words is "one billion, three hundred twenty-two million, one hundred forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •