Base | Representation |
---|---|
bin | 11001101100100011011000… |
… | …00101111110110101101001 |
3 | 21102001221220101202111220200 |
4 | 30312101230011332311221 |
5 | 24401300103213103414 |
6 | 320102403331342413 |
7 | 14621311230522561 |
oct | 1466215405766551 |
9 | 242057811674820 |
10 | 56506403253609 |
11 | 1700625a577171 |
12 | 64073a0151a09 |
13 | 256b6b96a9aaa |
14 | dd4cd2bd9da1 |
15 | 67ecdb96b109 |
hex | 33646c17ed69 |
56506403253609 has 24 divisors (see below), whose sum is σ = 81900073716552. Its totient is φ = 37541840582400.
The previous prime is 56506403253607. The next prime is 56506403253617. The reversal of 56506403253609 is 90635230460565.
It is a happy number.
56506403253609 is a `hidden beast` number, since 5 + 6 + 5 + 0 + 6 + 4 + 0 + 3 + 25 + 3 + 609 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 26762774225625 + 29743629027984 = 5173275^2 + 5453772^2 .
It is not a de Polignac number, because 56506403253609 - 21 = 56506403253607 is a prime.
It is not an unprimeable number, because it can be changed into a prime (56506403253607) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 310286509 + ... + 310468565.
It is an arithmetic number, because the mean of its divisors is an integer number (3412503071523).
Almost surely, 256506403253609 is an apocalyptic number.
It is an amenable number.
56506403253609 is a deficient number, since it is larger than the sum of its proper divisors (25393670462943).
56506403253609 is a wasteful number, since it uses less digits than its factorization.
56506403253609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300057 (or 300054 counting only the distinct ones).
The product of its (nonzero) digits is 17496000, while the sum is 54.
The spelling of 56506403253609 in words is "fifty-six trillion, five hundred six billion, four hundred three million, two hundred fifty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •