Base | Representation |
---|---|
bin | 10010101010111010100… |
… | …00000110111110010101 |
3 | 2021022212020221211012102 |
4 | 21111131100012332111 |
5 | 41002310221143221 |
6 | 1210412512531445 |
7 | 64230221251553 |
oct | 11253520067625 |
9 | 2238766854172 |
10 | 641514631061 |
11 | 228079315347 |
12 | a43b5b50b85 |
13 | 48657755765 |
14 | 23099a82bd3 |
15 | 11a497de30b |
hex | 955d406f95 |
641514631061 has 2 divisors, whose sum is σ = 641514631062. Its totient is φ = 641514631060.
The previous prime is 641514630947. The next prime is 641514631099. The reversal of 641514631061 is 160136415146.
641514631061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (641514631099) can be obtained adding 641514631061 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 519957808561 + 121556822500 = 721081^2 + 348650^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-641514631061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641514601061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320757315530 + 320757315531.
It is an arithmetic number, because the mean of its divisors is an integer number (320757315531).
Almost surely, 2641514631061 is an apocalyptic number.
It is an amenable number.
641514631061 is a deficient number, since it is larger than the sum of its proper divisors (1).
641514631061 is an equidigital number, since it uses as much as digits as its factorization.
641514631061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 641514631061 in words is "six hundred forty-one billion, five hundred fourteen million, six hundred thirty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •