Base | Representation |
---|---|
bin | 1101100001000… |
… | …1110111001001 |
3 | 10221200110122200 |
4 | 3120101313021 |
5 | 104003240030 |
6 | 5343110413 |
7 | 1255624143 |
oct | 330216711 |
9 | 127613580 |
10 | 56696265 |
11 | 2a00481a |
12 | 16ba2409 |
13 | b9912b2 |
14 | 775bc93 |
15 | 4e9dd60 |
hex | 3611dc9 |
56696265 has 24 divisors (see below), whose sum is σ = 102548160. Its totient is φ = 28922784.
The previous prime is 56696257. The next prime is 56696329. The reversal of 56696265 is 56269665.
56696265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56696265 - 23 = 56696257 is a prime.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 56696265.
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 23 ways as a sum of consecutive naturals, for example, 26355 + ... + 28424.
It is an arithmetic number, because the mean of its divisors is an integer number (4272840).
Almost surely, 256696265 is an apocalyptic number.
It is an amenable number.
56696265 is a deficient number, since it is larger than the sum of its proper divisors (45851895).
56696265 is a wasteful number, since it uses less digits than its factorization.
56696265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54813 (or 54810 counting only the distinct ones).
The product of its digits is 583200, while the sum is 45.
The square root of 56696265 is about 7529.6922247858. The cubic root of 56696265 is about 384.1653137499.
The spelling of 56696265 in words is "fifty-six million, six hundred ninety-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •