Base | Representation |
---|---|
bin | 1010000111111… |
… | …0100000001001 |
3 | 2221220020210210 |
4 | 2201332200021 |
5 | 41332224233 |
6 | 4114031333 |
7 | 1023625365 |
oct | 241764011 |
9 | 87806723 |
10 | 42461193 |
11 | 21a717a5 |
12 | 12278549 |
13 | 8a48b88 |
14 | 58d42a5 |
15 | 3adb163 |
hex | 287e809 |
42461193 has 4 divisors (see below), whose sum is σ = 56614928. Its totient is φ = 28307460.
The previous prime is 42461173. The next prime is 42461213. The reversal of 42461193 is 39116424.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (42461173) and next prime (42461213).
It is not a de Polignac number, because 42461193 - 26 = 42461129 is a prime.
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 42461193.
It is not an unprimeable number, because it can be changed into a prime (42461113) 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 3 ways as a sum of consecutive naturals, for example, 7076863 + ... + 7076868.
It is an arithmetic number, because the mean of its divisors is an integer number (14153732).
Almost surely, 242461193 is an apocalyptic number.
It is an amenable number.
42461193 is a deficient number, since it is larger than the sum of its proper divisors (14153735).
42461193 is a wasteful number, since it uses less digits than its factorization.
42461193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14153734.
The product of its digits is 5184, while the sum is 30.
The square root of 42461193 is about 6516.2253644269. The cubic root of 42461193 is about 348.8703524703.
The spelling of 42461193 in words is "forty-two million, four hundred sixty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •