Base | Representation |
---|---|
bin | 1101010110110… |
… | …1010000110001 |
3 | 10220102012211022 |
4 | 3111231100301 |
5 | 103320201230 |
6 | 5320425225 |
7 | 1250115431 |
oct | 325552061 |
9 | 126365738 |
10 | 56022065 |
11 | 29694230 |
12 | 16918215 |
13 | b7b6468 |
14 | 76242c1 |
15 | 4db91e5 |
hex | 356d431 |
56022065 has 8 divisors (see below), whose sum is σ = 73338048. Its totient is φ = 40743280.
The previous prime is 56022047. The next prime is 56022079.
It is a happy number.
56022065 is nontrivially palindromic in base 10.
56022065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 56022065 - 210 = 56021041 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 509237 + ... + 509346.
It is an arithmetic number, because the mean of its divisors is an integer number (9167256).
Almost surely, 256022065 is an apocalyptic number.
56022065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56022065 is a deficient number, since it is larger than the sum of its proper divisors (17315983).
56022065 is a wasteful number, since it uses less digits than its factorization.
56022065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1018599.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 56022065 is about 7484.7889081790. The cubic root of 56022065 is about 382.6364785593.
It can be divided in two parts, 5602 and 2065, that added together give a palindrome (7667).
The spelling of 56022065 in words is "fifty-six million, twenty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •