Base | Representation |
---|---|
bin | 1100011001110… |
… | …00011111111011 |
3 | 21020202210122202 |
4 | 12030320133323 |
5 | 203113243233 |
6 | 14153540415 |
7 | 2402220623 |
oct | 614703773 |
9 | 236683582 |
10 | 104040443 |
11 | 53801141 |
12 | 2aa1470b |
13 | 187298c0 |
14 | db63883 |
15 | 9201be8 |
hex | 63387fb |
104040443 has 4 divisors (see below), whose sum is σ = 112043568. Its totient is φ = 96037320.
The previous prime is 104040439. The next prime is 104040449. The reversal of 104040443 is 344040401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 344040401 = 1277 ⋅269413.
It is a cyclic number.
It is not a de Polignac number, because 104040443 - 22 = 104040439 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104040449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4001543 + ... + 4001568.
It is an arithmetic number, because the mean of its divisors is an integer number (28010892).
Almost surely, 2104040443 is an apocalyptic number.
104040443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104040443 is a deficient number, since it is larger than the sum of its proper divisors (8003125).
104040443 is an equidigital number, since it uses as much as digits as its factorization.
104040443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8003124.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 104040443 is about 10200.0217156632. The cubic root of 104040443 is about 470.3278879959.
Adding to 104040443 its reverse (344040401), we get a palindrome (448080844).
The spelling of 104040443 in words is "one hundred four million, forty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •