Base | Representation |
---|---|
bin | 1101100001101… |
… | …0000110101011 |
3 | 10221202011222010 |
4 | 3120122012223 |
5 | 104010330102 |
6 | 5343531003 |
7 | 1256124444 |
oct | 330320653 |
9 | 127664863 |
10 | 56730027 |
11 | 2a028122 |
12 | 16bb9a63 |
13 | b9a3783 |
14 | 776a2cb |
15 | 4ea8d6c |
hex | 361a1ab |
56730027 has 4 divisors (see below), whose sum is σ = 75640040. Its totient is φ = 37820016.
The previous prime is 56730017. The next prime is 56730041. The reversal of 56730027 is 72003765.
56730027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 56730027 - 26 = 56729963 is a prime.
It is a super-4 number, since 4×567300274 (a number of 32 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56729976 and 56730003.
It is not an unprimeable number, because it can be changed into a prime (56730007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9455002 + ... + 9455007.
It is an arithmetic number, because the mean of its divisors is an integer number (18910010).
Almost surely, 256730027 is an apocalyptic number.
56730027 is a deficient number, since it is larger than the sum of its proper divisors (18910013).
56730027 is a wasteful number, since it uses less digits than its factorization.
56730027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18910012.
The product of its (nonzero) digits is 8820, while the sum is 30.
The square root of 56730027 is about 7531.9338154288. The cubic root of 56730027 is about 384.2415540198.
The spelling of 56730027 in words is "fifty-six million, seven hundred thirty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •