Base | Representation |
---|---|
bin | 10010101010100110011… |
… | …01000010000101000101 |
3 | 2021022102111202010210002 |
4 | 21111103031002011011 |
5 | 41001434042134141 |
6 | 1210344051411045 |
7 | 64223103332624 |
oct | 11252315020505 |
9 | 2238374663702 |
10 | 641346052421 |
11 | 227aa2143758 |
12 | a43695b3a85 |
13 | 4862b850399 |
14 | 2308151d6bb |
15 | 11a39adee9b |
hex | 9553342145 |
641346052421 has 2 divisors, whose sum is σ = 641346052422. Its totient is φ = 641346052420.
The previous prime is 641346052411. The next prime is 641346052423. The reversal of 641346052421 is 124250643146.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 563867329921 + 77478722500 = 750911^2 + 278350^2 .
It is a cyclic number.
It is not a de Polignac number, because 641346052421 - 210 = 641346051397 is a prime.
It is a super-2 number, since 2×6413460524212 (a number of 24 digits) contains 22 as substring.
Together with 641346052423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641346052423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320673026210 + 320673026211.
It is an arithmetic number, because the mean of its divisors is an integer number (320673026211).
Almost surely, 2641346052421 is an apocalyptic number.
It is an amenable number.
641346052421 is a deficient number, since it is larger than the sum of its proper divisors (1).
641346052421 is an equidigital number, since it uses as much as digits as its factorization.
641346052421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 641346052421 its reverse (124250643146), we get a palindrome (765596695567).
The spelling of 641346052421 in words is "six hundred forty-one billion, three hundred forty-six million, fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •