Base | Representation |
---|---|
bin | 11001100101011110000110… |
… | …10001101110000100001001 |
3 | 21101012200202212222020211022 |
4 | 30302233003101232010021 |
5 | 24333303213010000203 |
6 | 315354520055042225 |
7 | 14564604620100206 |
oct | 1462570321560411 |
9 | 241180685866738 |
10 | 56263052812553 |
11 | 16a220325a0a84 |
12 | 63881a6670375 |
13 | 2551777144c82 |
14 | dc72095a0cad |
15 | 6787e77e6a38 |
hex | 332bc346e109 |
56263052812553 has 8 divisors (see below), whose sum is σ = 56430306286848. Its totient is φ = 56095801118784.
The previous prime is 56263052812511. The next prime is 56263052812559. The reversal of 56263052812553 is 35521825036265.
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 56263052812553 - 220 = 56263051763977 is a prime.
It is a super-2 number, since 2×562630528125532 (a number of 28 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 = 56263052812495 and 56263052812504.
It is not an unprimeable number, because it can be changed into a prime (56263052812559) 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, 90269300 + ... + 90890442.
It is an arithmetic number, because the mean of its divisors is an integer number (7053788285856).
Almost surely, 256263052812553 is an apocalyptic number.
It is an amenable number.
56263052812553 is a deficient number, since it is larger than the sum of its proper divisors (167253474295).
56263052812553 is a wasteful number, since it uses less digits than its factorization.
56263052812553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890263.
The product of its (nonzero) digits is 12960000, while the sum is 53.
The spelling of 56263052812553 in words is "fifty-six trillion, two hundred sixty-three billion, fifty-two million, eight hundred twelve thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •