Base | Representation |
---|---|
bin | 11001101111111100110100… |
… | …11110001011101110001011 |
3 | 21102111010020100211102000001 |
4 | 30313332122132023232023 |
5 | 24410203200214414023 |
6 | 320232151450223431 |
7 | 14632613221126261 |
oct | 1467763236135613 |
9 | 242433210742001 |
10 | 56623145466763 |
11 | 170508174a9867 |
12 | 6425b40a24b77 |
13 | 2579702971b25 |
14 | dda8095d4431 |
15 | 682d7090b6ad |
hex | 337f9a78bb8b |
56623145466763 has 6 divisors (see below), whose sum is σ = 58508619614412. Its totient is φ = 54796592386260.
The previous prime is 56623145466709. The next prime is 56623145466793. The reversal of 56623145466763 is 36766454132665.
It is a de Polignac number, because none of the positive numbers 2k-56623145466763 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56623145466695 and 56623145466704.
It is not an unprimeable number, because it can be changed into a prime (56623145466793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 29460532581 + ... + 29460534502.
It is an arithmetic number, because the mean of its divisors is an integer number (9751436602402).
Almost surely, 256623145466763 is an apocalyptic number.
56623145466763 is a deficient number, since it is larger than the sum of its proper divisors (1885474147649).
56623145466763 is an equidigital number, since it uses as much as digits as its factorization.
56623145466763 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58921067145 (or 58921067114 counting only the distinct ones).
The product of its digits is 391910400, while the sum is 64.
The spelling of 56623145466763 in words is "fifty-six trillion, six hundred twenty-three billion, one hundred forty-five million, four hundred sixty-six thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •