Base | Representation |
---|---|
bin | 1100011010001… |
… | …11000110010011 |
3 | 21020212211200120 |
4 | 12031013012103 |
5 | 203122201433 |
6 | 14155121323 |
7 | 2402560152 |
oct | 615070623 |
9 | 236784616 |
10 | 104100243 |
11 | 53842065 |
12 | 2aa43243 |
13 | 1874aba0 |
14 | db7b599 |
15 | 92147b3 |
hex | 6347193 |
104100243 has 8 divisors (see below), whose sum is σ = 149477328. Its totient is φ = 64061664.
The previous prime is 104100239. The next prime is 104100247. The reversal of 104100243 is 342001401.
It is an interprime number because it is at equal distance from previous prime (104100239) and next prime (104100247).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104100243 - 22 = 104100239 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104100247) 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 7 ways as a sum of consecutive naturals, for example, 1334580 + ... + 1334657.
It is an arithmetic number, because the mean of its divisors is an integer number (18684666).
Almost surely, 2104100243 is an apocalyptic number.
104100243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104100243 is a deficient number, since it is larger than the sum of its proper divisors (45377085).
104100243 is a wasteful number, since it uses less digits than its factorization.
104100243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2669253.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 104100243 is about 10202.9526608722. The cubic root of 104100243 is about 470.4179818734.
Adding to 104100243 its reverse (342001401), we get a palindrome (446101644).
The spelling of 104100243 in words is "one hundred four million, one hundred thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •