Base | Representation |
---|---|
bin | 11101001000001010001011… |
… | …00111011010010100111101 |
3 | 22101210022110001221102102022 |
4 | 32210011011213122110331 |
5 | 31343412011400311410 |
6 | 344121031203405525 |
7 | 16330414435301153 |
oct | 1644050547322475 |
9 | 271708401842368 |
10 | 64052015244605 |
11 | 19455341855933 |
12 | 72258623838a5 |
13 | 2998104a9aa6b |
14 | 11b61c3cad3d3 |
15 | 7612172c7455 |
hex | 3a41459da53d |
64052015244605 has 16 divisors (see below), whose sum is σ = 77273464320000. Its totient is φ = 50967641408640.
The previous prime is 64052015244541. The next prime is 64052015244641. The reversal of 64052015244605 is 50644251025046.
64052015244605 is digitally balanced in base 2 and base 6, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 64052015244605 - 26 = 64052015244541 is a prime.
It is a super-2 number, since 2×640520152446052 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 4826396 + ... + 12304394.
It is an arithmetic number, because the mean of its divisors is an integer number (4829591520000).
Almost surely, 264052015244605 is an apocalyptic number.
It is an amenable number.
64052015244605 is a deficient number, since it is larger than the sum of its proper divisors (13221449075395).
64052015244605 is a wasteful number, since it uses less digits than its factorization.
64052015244605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7487164.
The product of its (nonzero) digits is 1152000, while the sum is 44.
The spelling of 64052015244605 in words is "sixty-four trillion, fifty-two billion, fifteen million, two hundred forty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •