Base | Representation |
---|---|
bin | 1100011001110… |
… | …00000010100011 |
3 | 21020202201002010 |
4 | 12030320002203 |
5 | 203113213223 |
6 | 14153524003 |
7 | 2402212266 |
oct | 614700243 |
9 | 236681063 |
10 | 104038563 |
11 | 537aa792 |
12 | 2aa13603 |
13 | 18728aa5 |
14 | db62cdd |
15 | 9201393 |
hex | 63380a3 |
104038563 has 8 divisors (see below), whose sum is σ = 138865408. Its totient is φ = 69285384.
The previous prime is 104038553. The next prime is 104038577. The reversal of 104038563 is 365830401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104038563 - 25 = 104038531 is a prime.
It is a super-2 number, since 2×1040385632 = 21648045182209938, which contains 22 as substring.
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 104038563.
It is not an unprimeable number, because it can be changed into a prime (104038553) 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, 15031 + ... + 20832.
It is an arithmetic number, because the mean of its divisors is an integer number (17358176).
Almost surely, 2104038563 is an apocalyptic number.
104038563 is a deficient number, since it is larger than the sum of its proper divisors (34826845).
104038563 is an equidigital number, since it uses as much as digits as its factorization.
104038563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36833.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 104038563 is about 10199.9295585803. The cubic root of 104038563 is about 470.3250550535.
Adding to 104038563 its reverse (365830401), we get a palindrome (469868964).
The spelling of 104038563 in words is "one hundred four million, thirty-eight thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •