Base | Representation |
---|---|
bin | 100101110100001100100… |
… | …100010010001000100000 |
3 | 100012102121111122022222120 |
4 | 211310030210102020200 |
5 | 320034032002132003 |
6 | 5305451040104240 |
7 | 355514236662156 |
oct | 45641444221040 |
9 | 10172544568876 |
10 | 2598666052128 |
11 | 9120a726a623 |
12 | 35b780005080 |
13 | 15b08ca2b9c3 |
14 | 8dac18d73d6 |
15 | 478e5ba1853 |
hex | 25d0c912220 |
2598666052128 has 96 divisors (see below), whose sum is σ = 6872914976256. Its totient is φ = 859695925248.
The previous prime is 2598666052127. The next prime is 2598666052141. The reversal of 2598666052128 is 8212506668952.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (2598666052127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61832850 + ... + 61874862.
It is an arithmetic number, because the mean of its divisors is an integer number (71592864336).
Almost surely, 22598666052128 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 2598666052128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3436457488128).
2598666052128 is an abundant number, since it is smaller than the sum of its proper divisors (4274248924128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2598666052128 is a wasteful number, since it uses less digits than its factorization.
2598666052128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46866 (or 46858 counting only the distinct ones).
The product of its (nonzero) digits is 24883200, while the sum is 60.
The spelling of 2598666052128 in words is "two trillion, five hundred ninety-eight billion, six hundred sixty-six million, fifty-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •