Base | Representation |
---|---|
bin | 11101001010110100011001… |
… | …11101111000111100111000 |
3 | 22102010001100021221222021021 |
4 | 32211122030331320330320 |
5 | 31401411144044222020 |
6 | 344231024010152224 |
7 | 16340131261262020 |
oct | 1645321475707470 |
9 | 272101307858237 |
10 | 64143406632760 |
11 | 1949007a913494 |
12 | 723b509122674 |
13 | 29a390ac44a30 |
14 | 11ba7b38baa80 |
15 | 7637b58971aa |
hex | 3a568cf78f38 |
64143406632760 has 64 divisors (see below), whose sum is σ = 177627895300800. Its totient is φ = 20300330889216.
The previous prime is 64143406632749. The next prime is 64143406632859. The reversal of 64143406632760 is 6723660434146.
It is a super-2 number, since 2×641434066327602 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a junction number, because it is equal to n+sod(n) for n = 64143406632698 and 64143406632707.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8810903865 + ... + 8810911144.
It is an arithmetic number, because the mean of its divisors is an integer number (2775435864075).
Almost surely, 264143406632760 is an apocalyptic number.
It is an amenable number.
64143406632760 is an abundant number, since it is smaller than the sum of its proper divisors (113484488668040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64143406632760 is a wasteful number, since it uses less digits than its factorization.
64143406632760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17621815040 (or 17621815036 counting only the distinct ones).
The product of its (nonzero) digits is 10450944, while the sum is 52.
The spelling of 64143406632760 in words is "sixty-four trillion, one hundred forty-three billion, four hundred six million, six hundred thirty-two thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •