Base | Representation |
---|---|
bin | 101100011001011100011… |
… | …1110010010111110000000 |
3 | 210121100012212102122111010 |
4 | 1120302320332102332000 |
5 | 1244433301431224223 |
6 | 20551111133120520 |
7 | 1166565115565520 |
oct | 130627076227600 |
9 | 23540185378433 |
10 | 6101956898688 |
11 | 1a429096564a2 |
12 | 826725029140 |
13 | 353548405551 |
14 | 17149cac9680 |
15 | a8ad4dbe393 |
hex | 58cb8f92f80 |
6101956898688 has 512 divisors, whose sum is σ = 19544054906880. Its totient is φ = 1649184768000.
The previous prime is 6101956898657. The next prime is 6101956898699. The reversal of 6101956898688 is 8868986591016.
It is a super-2 number, since 2×61019568986882 (a number of 26 digits) contains 22 as substring.
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, 2178490888 + ... + 2178493688.
It is an arithmetic number, because the mean of its divisors is an integer number (38171982240).
Almost surely, 26101956898688 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 6101956898688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9772027453440).
6101956898688 is an abundant number, since it is smaller than the sum of its proper divisors (13442098008192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6101956898688 is a wasteful number, since it uses less digits than its factorization.
6101956898688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3226 (or 3214 counting only the distinct ones).
The product of its (nonzero) digits is 358318080, while the sum is 75.
The spelling of 6101956898688 in words is "six trillion, one hundred one billion, nine hundred fifty-six million, eight hundred ninety-eight thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •