Base | Representation |
---|---|
bin | 1101011001001… |
… | …0011000110011 |
3 | 10220200221102101 |
4 | 3112102120303 |
5 | 103340033011 |
6 | 5324001231 |
7 | 1251320656 |
oct | 326223063 |
9 | 126627371 |
10 | 56174131 |
11 | 29788502 |
12 | 16990217 |
13 | b83a740 |
14 | 766389d |
15 | 4de92c1 |
hex | 3592633 |
56174131 has 16 divisors (see below), whose sum is σ = 63201600. Its totient is φ = 49569408.
The previous prime is 56174123. The next prime is 56174143. The reversal of 56174131 is 13147165.
56174131 = T415 + T416 + ... + T741.
56174131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 56174131 - 23 = 56174123 is a prime.
It is a super-2 number, since 2×561741312 = 6311065987210322, which contains 22 as substring.
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 56174131.
It is not an unprimeable number, because it can be changed into a prime (56174161) 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 15 ways as a sum of consecutive naturals, for example, 40410 + ... + 41776.
It is an arithmetic number, because the mean of its divisors is an integer number (3950100).
Almost surely, 256174131 is an apocalyptic number.
56174131 is a deficient number, since it is larger than the sum of its proper divisors (7027469).
56174131 is a wasteful number, since it uses less digits than its factorization.
56174131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1518.
The product of its digits is 2520, while the sum is 28.
The square root of 56174131 is about 7494.9403600029. The cubic root of 56174131 is about 382.9823745999.
The spelling of 56174131 in words is "fifty-six million, one hundred seventy-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •