Base | Representation |
---|---|
bin | 10010101010111010100… |
… | …00000110111100100011 |
3 | 2021022212020221211001012 |
4 | 21111131100012330203 |
5 | 41002310221142242 |
6 | 1210412512531135 |
7 | 64230221251331 |
oct | 11253520067443 |
9 | 2238766854035 |
10 | 641514630947 |
11 | 228079315253 |
12 | a43b5b50aab |
13 | 486577556a8 |
14 | 23099a82b51 |
15 | 11a497de282 |
hex | 955d406f23 |
641514630947 has 2 divisors, whose sum is σ = 641514630948. Its totient is φ = 641514630946.
The previous prime is 641514630931. The next prime is 641514631061. The reversal of 641514630947 is 749036415146.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 641514630947 - 24 = 641514630931 is a prime.
It is a super-2 number, since 2×6415146309472 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 641514630895 and 641514630904.
It is not a weakly prime, because it can be changed into another prime (641514630847) 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, 320757315473 + 320757315474.
It is an arithmetic number, because the mean of its divisors is an integer number (320757315474).
Almost surely, 2641514630947 is an apocalyptic number.
641514630947 is a deficient number, since it is larger than the sum of its proper divisors (1).
641514630947 is an equidigital number, since it uses as much as digits as its factorization.
641514630947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 641514630947 in words is "six hundred forty-one billion, five hundred fourteen million, six hundred thirty thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •