Base | Representation |
---|---|
bin | 10010101010100001101… |
… | …00011101001101100011 |
3 | 2021022022201111002100111 |
4 | 21111100310131031203 |
5 | 41001343322234043 |
6 | 1210340102232151 |
7 | 64222106346610 |
oct | 11252064351543 |
9 | 2238281432314 |
10 | 641306055523 |
11 | 227a81605471 |
12 | a4358125657 |
13 | 48623488093 |
14 | 2307a0ab507 |
15 | 11a3633e09d |
hex | 9550d1d363 |
641306055523 has 8 divisors (see below), whose sum is σ = 776034218592. Its totient is φ = 517356145536.
The previous prime is 641306055521. The next prime is 641306055527. The reversal of 641306055523 is 325550603146.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 641306055523 - 21 = 641306055521 is a prime.
It is a super-2 number, since 2×6413060555232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (641306055521) 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 in 7 ways as a sum of consecutive naturals, for example, 2694563140 + ... + 2694563377.
It is an arithmetic number, because the mean of its divisors is an integer number (97004277324).
Almost surely, 2641306055523 is an apocalyptic number.
641306055523 is a deficient number, since it is larger than the sum of its proper divisors (134728163069).
641306055523 is a wasteful number, since it uses less digits than its factorization.
641306055523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5389126541.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 641306055523 its reverse (325550603146), we get a palindrome (966856658669).
The spelling of 641306055523 in words is "six hundred forty-one billion, three hundred six million, fifty-five thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •