Base | Representation |
---|---|
bin | 11001100100001110111010… |
… | …11011111101001001101011 |
3 | 21101001122001020102202202211 |
4 | 30302013131123331021223 |
5 | 24332104132224433233 |
6 | 315323205505305551 |
7 | 14561541304313020 |
oct | 1462073533751153 |
9 | 241048036382684 |
10 | 56220542030443 |
11 | 16a05aa83451aa |
12 | 637bb019352b7 |
13 | 254a760b5972b |
14 | dc5135777547 |
15 | 67765a6a45cd |
hex | 3321dd6fd26b |
56220542030443 has 4 divisors (see below), whose sum is σ = 64252048034800. Its totient is φ = 48189036026088.
The previous prime is 56220542030423. The next prime is 56220542030461. The reversal of 56220542030443 is 34403024502265.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56220542030443 is a prime.
It is a super-2 number, since 2×562205420304432 (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 = 56220542030396 and 56220542030405.
It is not an unprimeable number, because it can be changed into a prime (56220542030423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4015753002168 + ... + 4015753002181.
It is an arithmetic number, because the mean of its divisors is an integer number (16063012008700).
Almost surely, 256220542030443 is an apocalyptic number.
56220542030443 is a deficient number, since it is larger than the sum of its proper divisors (8031506004357).
56220542030443 is an equidigital number, since it uses as much as digits as its factorization.
56220542030443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8031506004356.
The product of its (nonzero) digits is 691200, while the sum is 40.
The spelling of 56220542030443 in words is "fifty-six trillion, two hundred twenty billion, five hundred forty-two million, thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •