Base | Representation |
---|---|
bin | 10000110101110001110100… |
… | …001010111000010101000000 |
3 | 100201020111001221112101002012 |
4 | 100311301310022320111000 |
5 | 34201432304423431230 |
6 | 421304411040112052 |
7 | 21412655003444405 |
oct | 2065616412702500 |
9 | 321214057471065 |
10 | 74064365061440 |
11 | 21665580250046 |
12 | 8382206005628 |
13 | 32433166ab7c0 |
14 | 1440a3d27a2ac |
15 | 8868b653a395 |
hex | 435c742b8540 |
74064365061440 has 448 divisors, whose sum is σ = 201578770132992. Its totient is φ = 25711224422400.
The previous prime is 74064365061419. The next prime is 74064365061473. The reversal of 74064365061440 is 4416056346047.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10639899560 + ... + 10639906520.
It is an arithmetic number, because the mean of its divisors is an integer number (449952611904).
Almost surely, 274064365061440 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 74064365061440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100789385066496).
74064365061440 is an abundant number, since it is smaller than the sum of its proper divisors (127514405071552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74064365061440 is a wasteful number, since it uses less digits than its factorization.
74064365061440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8898 (or 8888 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 50.
The spelling of 74064365061440 in words is "seventy-four trillion, sixty-four billion, three hundred sixty-five million, sixty-one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •