Base | Representation |
---|---|
bin | 1101011010100… |
… | …0111000001011 |
3 | 10220212121210020 |
4 | 3112220320023 |
5 | 103401010001 |
6 | 5325551523 |
7 | 1252153356 |
oct | 326507013 |
9 | 126777706 |
10 | 56266251 |
11 | 29840738 |
12 | 16a155a3 |
13 | b870652 |
14 | 768929d |
15 | 4e16736 |
hex | 35a8e0b |
56266251 has 8 divisors (see below), whose sum is σ = 75073344. Its totient is φ = 37485000.
The previous prime is 56266247. The next prime is 56266261. The reversal of 56266251 is 15266265.
It is a happy number.
56266251 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 56266251 - 22 = 56266247 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (56266241) 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 7 ways as a sum of consecutive naturals, for example, 625 + ... + 10626.
It is an arithmetic number, because the mean of its divisors is an integer number (9384168).
Almost surely, 256266251 is an apocalyptic number.
56266251 is a deficient number, since it is larger than the sum of its proper divisors (18807093).
56266251 is a wasteful number, since it uses less digits than its factorization.
56266251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12921.
The product of its digits is 21600, while the sum is 33.
The square root of 56266251 is about 7501.0833217609. The cubic root of 56266251 is about 383.1916112945.
The spelling of 56266251 in words is "fifty-six million, two hundred sixty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •