Base | Representation |
---|---|
bin | 10100110110000010010… |
… | …011110011101111101011 |
3 | 12001221022010202200012002 |
4 | 110312002103303233223 |
5 | 141432034021342311 |
6 | 3014012404441215 |
7 | 205326315000125 |
oct | 24660223635753 |
9 | 5057263680162 |
10 | 1432410340331 |
11 | 502533326723 |
12 | 1b173b3a920b |
13 | a50ca468349 |
14 | 4d486c06215 |
15 | 273d86a393b |
hex | 14d824f3beb |
1432410340331 has 2 divisors, whose sum is σ = 1432410340332. Its totient is φ = 1432410340330.
The previous prime is 1432410340201. The next prime is 1432410340343. The reversal of 1432410340331 is 1330430142341.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1432410340331 is a prime.
It is a super-2 number, since 2×14324103403312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1432410340294 and 1432410340303.
It is not a weakly prime, because it can be changed into another prime (1432410346331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 716205170165 + 716205170166.
It is an arithmetic number, because the mean of its divisors is an integer number (716205170166).
Almost surely, 21432410340331 is an apocalyptic number.
1432410340331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1432410340331 is an equidigital number, since it uses as much as digits as its factorization.
1432410340331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1432410340331 its reverse (1330430142341), we get a palindrome (2762840482672).
The spelling of 1432410340331 in words is "one trillion, four hundred thirty-two billion, four hundred ten million, three hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •