Base | Representation |
---|---|
bin | 1100100001001001101… |
… | …11111000111110000001 |
3 | 1112010012110221012102021 |
4 | 12100210313320332001 |
5 | 24021334013020031 |
6 | 525331532521441 |
7 | 43034442146161 |
oct | 6204467707601 |
9 | 1463173835367 |
10 | 430115360641 |
11 | 1564579a95aa |
12 | 6b438920281 |
13 | 31737894775 |
14 | 16b63a7a5a1 |
15 | b2c570d511 |
hex | 6424df8f81 |
430115360641 has 2 divisors, whose sum is σ = 430115360642. Its totient is φ = 430115360640.
The previous prime is 430115360569. The next prime is 430115360671. The reversal of 430115360641 is 146063511034.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 348104720016 + 82010640625 = 590004^2 + 286375^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-430115360641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 430115360597 and 430115360606.
It is not a weakly prime, because it can be changed into another prime (430115360671) 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, 215057680320 + 215057680321.
It is an arithmetic number, because the mean of its divisors is an integer number (215057680321).
Almost surely, 2430115360641 is an apocalyptic number.
It is an amenable number.
430115360641 is a deficient number, since it is larger than the sum of its proper divisors (1).
430115360641 is an equidigital number, since it uses as much as digits as its factorization.
430115360641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 430115360641 its reverse (146063511034), we get a palindrome (576178871675).
The spelling of 430115360641 in words is "four hundred thirty billion, one hundred fifteen million, three hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •