Base | Representation |
---|---|
bin | 101111101111010111110… |
… | …1110101000111100011110 |
3 | 212020021000200121220002020 |
4 | 1133132233232220330132 |
5 | 1330000133001101001 |
6 | 21542125414441010 |
7 | 1245020461556265 |
oct | 137365756507436 |
9 | 25207020556066 |
10 | 6561363300126 |
11 | 20aa72758a528 |
12 | 89b777363166 |
13 | 387970506acb |
14 | 1898009835dc |
15 | b5a21d64736 |
hex | 5f7afba8f1e |
6561363300126 has 8 divisors (see below), whose sum is σ = 13122726600264. Its totient is φ = 2187121100040.
The previous prime is 6561363300067. The next prime is 6561363300133. The reversal of 6561363300126 is 6210033631656.
It is a sphenic number, since it is the product of 3 distinct primes.
6561363300126 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 546780275005 + ... + 546780275016.
It is an arithmetic number, because the mean of its divisors is an integer number (1640340825033).
Almost surely, 26561363300126 is an apocalyptic number.
6561363300126 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6561363300126 is a wasteful number, since it uses less digits than its factorization.
6561363300126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093560550026.
The product of its (nonzero) digits is 349920, while the sum is 42.
The spelling of 6561363300126 in words is "six trillion, five hundred sixty-one billion, three hundred sixty-three million, three hundred thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •