Base | Representation |
---|---|
bin | 1100011001110… |
… | …01111001001101 |
3 | 21020210002111101 |
4 | 12030321321031 |
5 | 203113434112 |
6 | 14154023101 |
7 | 2402243365 |
oct | 614717115 |
9 | 236702441 |
10 | 104046157 |
11 | 53805466 |
12 | 2aa17a91 |
13 | 1872c397 |
14 | db659a5 |
15 | 9203757 |
hex | 6339e4d |
104046157 has 8 divisors (see below), whose sum is σ = 105124536. Its totient is φ = 102972672.
The previous prime is 104046149. The next prime is 104046161. The reversal of 104046157 is 751640401.
It can be written as a sum of positive squares in 4 ways, for example, as 46498761 + 57547396 = 6819^2 + 7586^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104046157 - 23 = 104046149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104046127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53433 + ... + 55345.
It is an arithmetic number, because the mean of its divisors is an integer number (13140567).
Almost surely, 2104046157 is an apocalyptic number.
It is an amenable number.
104046157 is a deficient number, since it is larger than the sum of its proper divisors (1078379).
104046157 is a wasteful number, since it uses less digits than its factorization.
104046157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2447.
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 104046157 is about 10200.3018092604. The cubic root of 104046157 is about 470.3364981231.
Adding to 104046157 its reverse (751640401), we get a palindrome (855686558).
It can be divided in two parts, 10404 and 6157, that added together give a palindrome (16561).
The spelling of 104046157 in words is "one hundred four million, forty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •