Base | Representation |
---|---|
bin | 101001000011000101101… |
… | …0111111000101110011101 |
3 | 201222100000220211022002201 |
4 | 1102012023113320232131 |
5 | 1214413024332314313 |
6 | 15555421301451501 |
7 | 1121410600533451 |
oct | 122061327705635 |
9 | 21870026738081 |
10 | 5641630354333 |
11 | 1885669292476 |
12 | 771476710b91 |
13 | 31c0077a711c |
14 | 1570b0950661 |
15 | 9bb4226e0dd |
hex | 5218b5f8b9d |
5641630354333 has 2 divisors, whose sum is σ = 5641630354334. Its totient is φ = 5641630354332.
The previous prime is 5641630354301. The next prime is 5641630354403. The reversal of 5641630354333 is 3334530361465.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5250527708409 + 391102645924 = 2291403^2 + 625382^2 .
It is a cyclic number.
It is not a de Polignac number, because 5641630354333 - 25 = 5641630354301 is a prime.
It is a super-2 number, since 2×56416303543332 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5641630354033) 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, 2820815177166 + 2820815177167.
It is an arithmetic number, because the mean of its divisors is an integer number (2820815177167).
Almost surely, 25641630354333 is an apocalyptic number.
It is an amenable number.
5641630354333 is a deficient number, since it is larger than the sum of its proper divisors (1).
5641630354333 is an equidigital number, since it uses as much as digits as its factorization.
5641630354333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 46.
The spelling of 5641630354333 in words is "five trillion, six hundred forty-one billion, six hundred thirty million, three hundred fifty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •