Base | Representation |
---|---|
bin | 110100101111010011… |
… | …110010110111100001 |
3 | 12102011112010100101111 |
4 | 310233103302313201 |
5 | 1411433320334324 |
6 | 42003100503321 |
7 | 4043205356254 |
oct | 645723626741 |
9 | 172145110344 |
10 | 56628293089 |
11 | 2201a216825 |
12 | ab8484ab41 |
13 | 545605c444 |
14 | 2a52b6d09b |
15 | 1716738794 |
hex | d2f4f2de1 |
56628293089 has 3 divisors (see below), whose sum is σ = 56628531057. Its totient is φ = 56628055122.
The previous prime is 56628293087. The next prime is 56628293119. The reversal of 56628293089 is 98039282665.
It is a happy number.
The square root of 56628293089 is 237967.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 56628293089 - 21 = 56628293087 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56628293087) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 118984 + ... + 356950.
It is an arithmetic number, because the mean of its divisors is an integer number (18876177019).
Almost surely, 256628293089 is an apocalyptic number.
56628293089 is the 237967-th square number.
56628293089 is the 118984-th centered octagonal number.
It is an amenable number.
56628293089 is a deficient number, since it is larger than the sum of its proper divisors (237968).
56628293089 is an frugal number, since it uses more digits than its factorization.
56628293089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475934 (or 237967 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 58.
The spelling of 56628293089 in words is "fifty-six billion, six hundred twenty-eight million, two hundred ninety-three thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •