Base | Representation |
---|---|
bin | 10010000111001101101101 |
3 | 22221020020002 |
4 | 102013031231 |
5 | 2203420031 |
6 | 245434045 |
7 | 55233656 |
oct | 22071555 |
9 | 8836202 |
10 | 4748141 |
11 | 2753392 |
12 | 170b925 |
13 | ca3268 |
14 | 8b852d |
15 | 63bccb |
hex | 48736d |
4748141 has 4 divisors (see below), whose sum is σ = 4911900. Its totient is φ = 4584384.
The previous prime is 4748131. The next prime is 4748153. The reversal of 4748141 is 1418474.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1418474 = 2 ⋅709237.
It can be written as a sum of positive squares in 2 ways, for example, as 2468041 + 2280100 = 1571^2 + 1510^2 .
It is a cyclic number.
It is not a de Polignac number, because 4748141 - 26 = 4748077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 163729 = 4748141 / (4 + 7 + 4 + 8 + 1 + 4 + 1).
It is an Ulam number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4748131) 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, 81836 + ... + 81893.
It is an arithmetic number, because the mean of its divisors is an integer number (1227975).
Almost surely, 24748141 is an apocalyptic number.
It is an amenable number.
4748141 is a deficient number, since it is larger than the sum of its proper divisors (163759).
4748141 is a wasteful number, since it uses less digits than its factorization.
4748141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163758.
The product of its digits is 3584, while the sum is 29.
The square root of 4748141 is about 2179.0229461848. The cubic root of 4748141 is about 168.0768379617.
The spelling of 4748141 in words is "four million, seven hundred forty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •