Base | Representation |
---|---|
bin | 11101010110001001001001… |
… | …01000001100000110000100 |
3 | 22110111020122202021100220020 |
4 | 32223010210220030012010 |
5 | 31424300024010344401 |
6 | 345125453111335140 |
7 | 16410214314430545 |
oct | 1653044450140604 |
9 | 273436582240806 |
10 | 64532498137476 |
11 | 19620095926926 |
12 | 72a29b70814b0 |
13 | 2a015085b6525 |
14 | 11d1564dcc4cc |
15 | 76d989778d36 |
hex | 3ab124a0c184 |
64532498137476 has 12 divisors (see below), whose sum is σ = 150575828987472. Its totient is φ = 21510832712488.
The previous prime is 64532498137433. The next prime is 64532498137483. The reversal of 64532498137476 is 67473189423546.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 64532498137476.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2688854089050 + ... + 2688854089073.
It is an arithmetic number, because the mean of its divisors is an integer number (12547985748956).
Almost surely, 264532498137476 is an apocalyptic number.
It is an amenable number.
64532498137476 is an abundant number, since it is smaller than the sum of its proper divisors (86043330849996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64532498137476 is a wasteful number, since it uses less digits than its factorization.
64532498137476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5377708178130 (or 5377708178128 counting only the distinct ones).
The product of its digits is 731566080, while the sum is 69.
The spelling of 64532498137476 in words is "sixty-four trillion, five hundred thirty-two billion, four hundred ninety-eight million, one hundred thirty-seven thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •