Base | Representation |
---|---|
bin | 101100100000100001001… |
… | …0100101111011000000000 |
3 | 210122210102102201012120110 |
4 | 1121001002110233120000 |
5 | 1300210403404201223 |
6 | 21002102251511320 |
7 | 1200643404316161 |
oct | 131010224573000 |
9 | 23583372635513 |
10 | 6117146162688 |
11 | 1a492a3598340 |
12 | 829663a58540 |
13 | 354ac921a022 |
14 | 1721000d9768 |
15 | a91c361bd93 |
hex | 5904252f600 |
6117146162688 has 160 divisors (see below), whose sum is σ = 17781179074560. Its totient is φ = 1853344604160.
The previous prime is 6117146162669. The next prime is 6117146162707. The reversal of 6117146162688 is 8862616417116.
It is an interprime number because it is at equal distance from previous prime (6117146162669) and next prime (6117146162707).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102681006 + ... + 102740562.
It is an arithmetic number, because the mean of its divisors is an integer number (111132369216).
Almost surely, 26117146162688 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 6117146162688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8890589537280).
6117146162688 is an abundant number, since it is smaller than the sum of its proper divisors (11664032911872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6117146162688 is a wasteful number, since it uses less digits than its factorization.
6117146162688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65668 (or 65652 counting only the distinct ones).
The product of its digits is 4644864, while the sum is 57.
The spelling of 6117146162688 in words is "six trillion, one hundred seventeen billion, one hundred forty-six million, one hundred sixty-two thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •