Base | Representation |
---|---|
bin | 10011110000001100011101 |
3 | 100202002002000 |
4 | 103300030131 |
5 | 2311200031 |
6 | 302552513 |
7 | 62004423 |
oct | 23601435 |
9 | 10662060 |
10 | 5178141 |
11 | 2a17461 |
12 | 1898739 |
13 | 10c3bb7 |
14 | 98b113 |
15 | 6c43e6 |
hex | 4f031d |
5178141 has 8 divisors (see below), whose sum is σ = 7671360. Its totient is φ = 3452076.
The previous prime is 5178139. The next prime is 5178143. The reversal of 5178141 is 1418715.
5178141 is a `hidden beast` number, since 517 + 8 + 141 = 666.
It is an interprime number because it is at equal distance from previous prime (5178139) and next prime (5178143).
It is not a de Polignac number, because 5178141 - 21 = 5178139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 191783 = 5178141 / (5 + 1 + 7 + 8 + 1 + 4 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5178143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95865 + ... + 95918.
It is an arithmetic number, because the mean of its divisors is an integer number (958920).
Almost surely, 25178141 is an apocalyptic number.
It is an amenable number.
5178141 is a deficient number, since it is larger than the sum of its proper divisors (2493219).
5178141 is a wasteful number, since it uses less digits than its factorization.
5178141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191792 (or 191786 counting only the distinct ones).
The product of its digits is 1120, while the sum is 27.
The square root of 5178141 is about 2275.5528998465. The cubic root of 5178141 is about 173.0047221583.
The spelling of 5178141 in words is "five million, one hundred seventy-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •