Base | Representation |
---|---|
bin | 101111101011110010010… |
… | …1001010000011000100000 |
3 | 212012112010220122221210220 |
4 | 1133113210221100120200 |
5 | 1324333344223143111 |
6 | 21534413234523040 |
7 | 1244325555416331 |
oct | 137274451203040 |
9 | 25175126587726 |
10 | 6553661146656 |
11 | 20a7434955638 |
12 | 89a187a36480 |
13 | 3870138b9550 |
14 | 1892ada8c288 |
15 | b5720a9ee06 |
hex | 5f5e4a50620 |
6553661146656 has 96 divisors (see below), whose sum is σ = 18527384715840. Its totient is φ = 2016436153344.
The previous prime is 6553661146639. The next prime is 6553661146657. The reversal of 6553661146656 is 6566411663556.
It is a tau number, because it is divible by the number of its divisors (96).
It is a self number, because there is not a number n which added to its sum of digits gives 6553661146656.
It is not an unprimeable number, because it can be changed into a prime (6553661146657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40120315 + ... + 40283333.
It is an arithmetic number, because the mean of its divisors is an integer number (192993590790).
Almost surely, 26553661146656 is an apocalyptic number.
It is an amenable number.
6553661146656 is an abundant number, since it is smaller than the sum of its proper divisors (11973723569184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6553661146656 is a wasteful number, since it uses less digits than its factorization.
6553661146656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195258 (or 195250 counting only the distinct ones).
The product of its digits is 69984000, while the sum is 60.
The spelling of 6553661146656 in words is "six trillion, five hundred fifty-three billion, six hundred sixty-one million, one hundred forty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •