Base | Representation |
---|---|
bin | 100001110000000… |
… | …0010000101100111 |
3 | 2220220221110122201 |
4 | 1003200002011213 |
5 | 4304403030011 |
6 | 304212435331 |
7 | 40030561435 |
oct | 10340020547 |
9 | 2826843581 |
10 | 1132470631 |
11 | 531282a46 |
12 | 277318b47 |
13 | 15080c386 |
14 | aa591d55 |
15 | 6964bcc1 |
hex | 43802167 |
1132470631 has 2 divisors, whose sum is σ = 1132470632. Its totient is φ = 1132470630.
The previous prime is 1132470613. The next prime is 1132470643. The reversal of 1132470631 is 1360742311.
Together with previous prime (1132470613) 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 1132470631 - 213 = 1132462439 is a prime.
It is a super-2 number, since 2×11324706312 = 2564979460155076322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1132470631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132470611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566235315 + 566235316.
It is an arithmetic number, because the mean of its divisors is an integer number (566235316).
Almost surely, 21132470631 is an apocalyptic number.
1132470631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132470631 is an equidigital number, since it uses as much as digits as its factorization.
1132470631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 1132470631 is about 33652.2009829966. The cubic root of 1132470631 is about 1042.3389882586.
The spelling of 1132470631 in words is "one billion, one hundred thirty-two million, four hundred seventy thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •