Base | Representation |
---|---|
bin | 110000011011011100100… |
… | …0111100010001110001001 |
3 | 212120022022210021120112101 |
4 | 1200312321013202032021 |
5 | 1333023002041223031 |
6 | 22053421232113401 |
7 | 1254611064242155 |
oct | 140667107421611 |
9 | 25508283246471 |
10 | 6656010101641 |
11 | 21368861a934a |
12 | 8b5b90395861 |
13 | 393874c51984 |
14 | 19021ca82065 |
15 | b821112b361 |
hex | 60db91e2389 |
6656010101641 has 8 divisors (see below), whose sum is σ = 7006643421120. Its totient is φ = 6305408482032.
The previous prime is 6656010101623. The next prime is 6656010101659. The reversal of 6656010101641 is 1461010106566.
It is an interprime number because it is at equal distance from previous prime (6656010101623) and next prime (6656010101659).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6656010101641 - 231 = 6653862617993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6656010101641.
It is not an unprimeable number, because it can be changed into a prime (6656010101681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7493365 + ... + 8334418.
It is an arithmetic number, because the mean of its divisors is an integer number (875830427640).
Almost surely, 26656010101641 is an apocalyptic number.
It is an amenable number.
6656010101641 is a deficient number, since it is larger than the sum of its proper divisors (350633319479).
6656010101641 is a wasteful number, since it uses less digits than its factorization.
6656010101641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15849935.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 6656010101641 in words is "six trillion, six hundred fifty-six billion, ten million, one hundred one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •