Base | Representation |
---|---|
bin | 1101011101110… |
… | …0001001100101 |
3 | 10221021021212101 |
4 | 3113130021211 |
5 | 103424220021 |
6 | 5334252101 |
7 | 1254016552 |
oct | 327341145 |
9 | 127237771 |
10 | 56476261 |
11 | 299744a6 |
12 | 16ab7031 |
13 | b91510a |
14 | 7701a29 |
15 | 4e58a91 |
hex | 35dc265 |
56476261 has 4 divisors (see below), whose sum is σ = 59798412. Its totient is φ = 53154112.
The previous prime is 56476249. The next prime is 56476267. The reversal of 56476261 is 16267465.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16267465 = 5 ⋅3253493.
It can be written as a sum of positive squares in 2 ways, for example, as 18653761 + 37822500 = 4319^2 + 6150^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56476261 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56476261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56476267) 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, 1661050 + ... + 1661083.
It is an arithmetic number, because the mean of its divisors is an integer number (14949603).
Almost surely, 256476261 is an apocalyptic number.
It is an amenable number.
56476261 is a deficient number, since it is larger than the sum of its proper divisors (3322151).
56476261 is a wasteful number, since it uses less digits than its factorization.
56476261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3322150.
The product of its digits is 60480, while the sum is 37.
The square root of 56476261 is about 7515.0689284929. The cubic root of 56476261 is about 383.6677650255.
The spelling of 56476261 in words is "fifty-six million, four hundred seventy-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •