Base | Representation |
---|---|
bin | 1000000001100000111111000… |
… | …0001110101011100011001101 |
3 | 2202001010202221022112000120212 |
4 | 2000120033300032223203031 |
5 | 1043001132321323120401 |
6 | 5320501023330052205 |
7 | 226633112126061335 |
oct | 20030176016534315 |
9 | 2661122838460525 |
10 | 564616136145101 |
11 | 1539a43a4383747 |
12 | 533aa48171a065 |
13 | 1b3080c4a0bb51 |
14 | 9d5d7d14280c5 |
15 | 4541e64c13dbb |
hex | 20183f03ab8cd |
564616136145101 has 8 divisors (see below), whose sum is σ = 606978153079680. Its totient is φ = 523518657029568.
The previous prime is 564616136145053. The next prime is 564616136145137. The reversal of 564616136145101 is 101541631616465.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 564616136145101 - 218 = 564616135882957 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 564616136145101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564616136145301) 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, 316134453836 + ... + 316134455621.
It is an arithmetic number, because the mean of its divisors is an integer number (75872269134960).
Almost surely, 2564616136145101 is an apocalyptic number.
It is an amenable number.
564616136145101 is a deficient number, since it is larger than the sum of its proper divisors (42362016934579).
564616136145101 is a wasteful number, since it uses less digits than its factorization.
564616136145101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 632268909523.
The product of its (nonzero) digits is 1555200, while the sum is 50.
The spelling of 564616136145101 in words is "five hundred sixty-four trillion, six hundred sixteen billion, one hundred thirty-six million, one hundred forty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •