Base | Representation |
---|---|
bin | 110000011110110111… |
… | …1110001110111110011 |
3 | 100221201222000122020122 |
4 | 1200331233301313303 |
5 | 3201211434302243 |
6 | 115455125000455 |
7 | 10344033114212 |
oct | 1407557616763 |
9 | 327658018218 |
10 | 104115150323 |
11 | 40178319488 |
12 | 18217b5312b |
13 | 9a8324a832 |
14 | 50797cb079 |
15 | 2a95658668 |
hex | 183dbf1df3 |
104115150323 has 8 divisors (see below), whose sum is σ = 105998069856. Its totient is φ = 102237912000.
The previous prime is 104115150317. The next prime is 104115150329. The reversal of 104115150323 is 323051511401.
It is an interprime number because it is at equal distance from previous prime (104115150317) and next prime (104115150329).
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 104115150323 - 26 = 104115150259 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104115150292 and 104115150301.
It is not an unprimeable number, because it can be changed into a prime (104115150329) 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, 1383311 + ... + 1456632.
It is an arithmetic number, because the mean of its divisors is an integer number (13249758732).
Almost surely, 2104115150323 is an apocalyptic number.
104115150323 is a deficient number, since it is larger than the sum of its proper divisors (1882919533).
104115150323 is an equidigital number, since it uses as much as digits as its factorization.
104115150323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2840605.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 104115150323 its reverse (323051511401), we get a palindrome (427166661724).
The spelling of 104115150323 in words is "one hundred four billion, one hundred fifteen million, one hundred fifty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •