Base | Representation |
---|---|
bin | 100110110001000110101… |
… | …011001010110010111110 |
3 | 100102200102022010201101120 |
4 | 212301012223022302332 |
5 | 322122001223220204 |
6 | 5355504344051410 |
7 | 363321011440206 |
oct | 46610653126276 |
9 | 10380368121346 |
10 | 2664065445054 |
11 | 937907545492 |
12 | 370392163b66 |
13 | 1642b2ca5940 |
14 | 92d274d5406 |
15 | 4947244e6d9 |
hex | 26c46acacbe |
2664065445054 has 128 divisors (see below), whose sum is σ = 6107345298432. Its totient is φ = 767460096000.
The previous prime is 2664065445043. The next prime is 2664065445101. The reversal of 2664065445054 is 4505445604662.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2664065444988 and 2664065445006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 291883839 + ... + 291892965.
It is an arithmetic number, because the mean of its divisors is an integer number (47713635144).
Almost surely, 22664065445054 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2664065445054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3053672649216).
2664065445054 is an abundant number, since it is smaller than the sum of its proper divisors (3443279853378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2664065445054 is a wasteful number, since it uses less digits than its factorization.
2664065445054 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10290.
The product of its (nonzero) digits is 13824000, while the sum is 51.
The spelling of 2664065445054 in words is "two trillion, six hundred sixty-four billion, sixty-five million, four hundred forty-five thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •