Base | Representation |
---|---|
bin | 11101010010010110000001… |
… | …01100100111001111011000 |
3 | 22110000202202012100212001222 |
4 | 32221023000230213033120 |
5 | 31420130214433304020 |
6 | 344545505135231212 |
7 | 16364613626335106 |
oct | 1651130054471730 |
9 | 273022665325058 |
10 | 64401972556760 |
11 | 1957a7a5609173 |
12 | 728164a378508 |
13 | 29c21068712b7 |
14 | 11c9101bccc76 |
15 | 76a39a6e7b25 |
hex | 3a92c0b273d8 |
64401972556760 has 32 divisors (see below), whose sum is σ = 145159103397600. Its totient is φ = 25715515219200.
The previous prime is 64401972556723. The next prime is 64401972556763. The reversal of 64401972556760 is 6765527910446.
It is a super-2 number, since 2×644019725567602 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64401972556693 and 64401972556702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64401972556763) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1414783316 + ... + 1414828835.
It is an arithmetic number, because the mean of its divisors is an integer number (4536221981175).
Almost surely, 264401972556760 is an apocalyptic number.
It is an amenable number.
64401972556760 is an abundant number, since it is smaller than the sum of its proper divisors (80757130840840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64401972556760 is a wasteful number, since it uses less digits than its factorization.
64401972556760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2829612731 (or 2829612727 counting only the distinct ones).
The product of its (nonzero) digits is 76204800, while the sum is 62.
The spelling of 64401972556760 in words is "sixty-four trillion, four hundred one billion, nine hundred seventy-two million, five hundred fifty-six thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •