Base | Representation |
---|---|
bin | 101010101001101… |
… | …0001111100111111 |
3 | 10200201220022022201 |
4 | 1111103101330333 |
5 | 10412331231011 |
6 | 354001452331 |
7 | 50315204416 |
oct | 12523217477 |
9 | 3621808281 |
10 | 1431117631 |
11 | 674912949 |
12 | 33b3410a7 |
13 | 19a655388 |
14 | d80d247d |
15 | 8598ecc1 |
hex | 554d1f3f |
1431117631 has 2 divisors, whose sum is σ = 1431117632. Its totient is φ = 1431117630.
The previous prime is 1431117577. The next prime is 1431117637. The reversal of 1431117631 is 1367111341.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1431117631 - 27 = 1431117503 is a prime.
It is a super-2 number, since 2×14311176312 = 4096195347518104322, 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 1431117631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1431117637) 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, 715558815 + 715558816.
It is an arithmetic number, because the mean of its divisors is an integer number (715558816).
Almost surely, 21431117631 is an apocalyptic number.
1431117631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431117631 is an equidigital number, since it uses as much as digits as its factorization.
1431117631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1512, while the sum is 28.
The square root of 1431117631 is about 37830.1153976564. The cubic root of 1431117631 is about 1126.9166028242.
Adding to 1431117631 its reverse (1367111341), we get a palindrome (2798228972).
The spelling of 1431117631 in words is "one billion, four hundred thirty-one million, one hundred seventeen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •