Base | Representation |
---|---|
bin | 11101001001110110111100… |
… | …01101001100010101001010 |
3 | 22101222220011200201021002020 |
4 | 32210323132031030111022 |
5 | 31400341104411013201 |
6 | 344203525442545310 |
7 | 16334552502322416 |
oct | 1644733615142512 |
9 | 271886150637066 |
10 | 64110409860426 |
11 | 19478088014006 |
12 | 723503a668236 |
13 | 29a077ca58587 |
14 | 11b8d63469d46 |
15 | 7629d3b15a36 |
hex | 3a4ede34c54a |
64110409860426 has 8 divisors (see below), whose sum is σ = 128220819720864. Its totient is φ = 21370136620140.
The previous prime is 64110409860403. The next prime is 64110409860437. The reversal of 64110409860426 is 62406890401146.
It is a sphenic number, since it is the product of 3 distinct primes.
64110409860426 is an admirable number.
It is a super-2 number, since 2×641104098604262 (a number of 28 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5342534155030 + ... + 5342534155041.
It is an arithmetic number, because the mean of its divisors is an integer number (16027602465108).
Almost surely, 264110409860426 is an apocalyptic number.
64110409860426 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64110409860426 is a wasteful number, since it uses less digits than its factorization.
64110409860426 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10685068310076.
The product of its (nonzero) digits is 1990656, while the sum is 51.
The spelling of 64110409860426 in words is "sixty-four trillion, one hundred ten billion, four hundred nine million, eight hundred sixty thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •