Base | Representation |
---|---|
bin | 10010101000111100111… |
… | …01010000100100101101 |
3 | 2021020010211120120222212 |
4 | 21110132131100210231 |
5 | 40443131021114040 |
6 | 1210120200220205 |
7 | 64162136433323 |
oct | 11243635204455 |
9 | 2236124516885 |
10 | 640461113645 |
11 | 2276886690a1 |
12 | a416116a665 |
13 | 4851a3cb182 |
14 | 22dd9ba3d13 |
15 | 119d708ad65 |
hex | 951e75092d |
640461113645 has 16 divisors (see below), whose sum is σ = 778925093040. Its totient is φ = 505490496000.
The previous prime is 640461113641. The next prime is 640461113657. The reversal of 640461113645 is 546311164046.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 53415529924 + 587045583721 = 231118^2 + 766189^2 .
It is not a de Polignac number, because 640461113645 - 22 = 640461113641 is a prime.
It is a super-3 number, since 3×6404611136453 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (640461113641) 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 15 ways as a sum of consecutive naturals, for example, 2114750 + ... + 2398559.
It is an arithmetic number, because the mean of its divisors is an integer number (48682818315).
Almost surely, 2640461113645 is an apocalyptic number.
It is an amenable number.
640461113645 is a deficient number, since it is larger than the sum of its proper divisors (138463979395).
640461113645 is a wasteful number, since it uses less digits than its factorization.
640461113645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4513696.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 640461113645 in words is "six hundred forty billion, four hundred sixty-one million, one hundred thirteen thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •