Base | Representation |
---|---|
bin | 110100100100011100… |
… | …010011011000101111 |
3 | 12101200211001120200222 |
4 | 310210130103120233 |
5 | 1411100132132223 |
6 | 41533025041555 |
7 | 4035532602023 |
oct | 644434233057 |
9 | 171624046628 |
10 | 56445974063 |
11 | 21a3630a846 |
12 | ab337862bb |
13 | 5427355b6b |
14 | 2a36870383 |
15 | 17057230c8 |
hex | d2471362f |
56445974063 has 8 divisors (see below), whose sum is σ = 58331082240. Its totient is φ = 54564882840.
The previous prime is 56445974027. The next prime is 56445974069. The reversal of 56445974063 is 36047954465.
56445974063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 56445974063 - 212 = 56445969967 is a prime.
It is a super-2 number, since 2×564459740632 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56445973996 and 56445974014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56445974069) 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, 975653 + ... + 1031886.
It is an arithmetic number, because the mean of its divisors is an integer number (7291385280).
Almost surely, 256445974063 is an apocalyptic number.
56445974063 is a deficient number, since it is larger than the sum of its proper divisors (1885108177).
56445974063 is a wasteful number, since it uses less digits than its factorization.
56445974063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2008477.
The product of its (nonzero) digits is 10886400, while the sum is 53.
The spelling of 56445974063 in words is "fifty-six billion, four hundred forty-five million, nine hundred seventy-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •