Base | Representation |
---|---|
bin | 101001001001100000001… |
… | …1101111110100101111101 |
3 | 202000122120222012220220002 |
4 | 1102103000131332211331 |
5 | 1220124232421424230 |
6 | 20010020242404045 |
7 | 1122406143141533 |
oct | 122230035764575 |
9 | 22018528186802 |
10 | 5655406045565 |
11 | 1890498305161 |
12 | 774080060625 |
13 | 3203c179a303 |
14 | 157a1a318153 |
15 | 9c19b845545 |
hex | 524c077e97d |
5655406045565 has 8 divisors (see below), whose sum is σ = 6786739150080. Its totient is φ = 4524156906192.
The previous prime is 5655406045507. The next prime is 5655406045567.
5655406045565 is nontrivially palindromic in base 10.
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 5655406045565 - 232 = 5651111078269 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5655406045565.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5655406045567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20843009 + ... + 21112598.
It is an arithmetic number, because the mean of its divisors is an integer number (848342393760).
Almost surely, 25655406045565 is an apocalyptic number.
It is an amenable number.
5655406045565 is a deficient number, since it is larger than the sum of its proper divisors (1131333104515).
5655406045565 is a wasteful number, since it uses less digits than its factorization.
5655406045565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41982571.
The product of its (nonzero) digits is 54000000, while the sum is 56.
The spelling of 5655406045565 in words is "five trillion, six hundred fifty-five billion, four hundred six million, forty-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •