Base | Representation |
---|---|
bin | 11111100011100011110… |
… | …100110110101100011000 |
3 | 21200022020111121100011212 |
4 | 133203203310312230120 |
5 | 241012024331110403 |
6 | 4340104424242252 |
7 | 312445046116052 |
oct | 37434364665430 |
9 | 7608214540155 |
10 | 2168485800728 |
11 | 76671677a6a5 |
12 | 2b0325610388 |
13 | 129644897150 |
14 | 76d533a88d2 |
15 | 3b6199264d8 |
hex | 1f8e3d36b18 |
2168485800728 has 128 divisors (see below), whose sum is σ = 4695506565120. Its totient is φ = 930862056960.
The previous prime is 2168485800671. The next prime is 2168485800769. The reversal of 2168485800728 is 8270085848612.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 158149793 + ... + 158163503.
It is an arithmetic number, because the mean of its divisors is an integer number (36683645040).
Almost surely, 22168485800728 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 2168485800728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2347753282560).
2168485800728 is an abundant number, since it is smaller than the sum of its proper divisors (2527020764392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2168485800728 is a wasteful number, since it uses less digits than its factorization.
2168485800728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15577 (or 15573 counting only the distinct ones).
The product of its (nonzero) digits is 13762560, while the sum is 59.
The spelling of 2168485800728 in words is "two trillion, one hundred sixty-eight billion, four hundred eighty-five million, eight hundred thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •