Base | Representation |
---|---|
bin | 1101011110100… |
… | …0010011000101 |
3 | 10221100211010100 |
4 | 3113220103011 |
5 | 103432313041 |
6 | 5335314313 |
7 | 1254314616 |
oct | 327502305 |
9 | 127324110 |
10 | 56526021 |
11 | 299a8922 |
12 | 16b1b999 |
13 | b931966 |
14 | 7715c0d |
15 | 4e686b6 |
hex | 35e84c5 |
56526021 has 12 divisors (see below), whose sum is σ = 81895372. Its totient is φ = 37570176.
The previous prime is 56526013. The next prime is 56526023. The reversal of 56526021 is 12062565.
56526021 is a `hidden beast` number, since 5 + 6 + 52 + 602 + 1 = 666.
56526021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4901796 + 51624225 = 2214^2 + 7185^2 .
It is not a de Polignac number, because 56526021 - 23 = 56526013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56526023) 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 11 ways as a sum of consecutive naturals, for example, 6286 + ... + 12351.
Almost surely, 256526021 is an apocalyptic number.
It is an amenable number.
56526021 is a deficient number, since it is larger than the sum of its proper divisors (25369351).
56526021 is a wasteful number, since it uses less digits than its factorization.
56526021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18980 (or 18977 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 56526021 is about 7518.3788811153. The cubic root of 56526021 is about 383.7804123775.
Adding to 56526021 its reverse (12062565), we get a palindrome (68588586).
The spelling of 56526021 in words is "fifty-six million, five hundred twenty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •