Base | Representation |
---|---|
bin | 1100011111111… |
… | …11111000000011 |
3 | 21022022021212222 |
4 | 12033333320003 |
5 | 203320411331 |
6 | 14223241255 |
7 | 2412161543 |
oct | 617777003 |
9 | 238267788 |
10 | 104857091 |
11 | 54209759 |
12 | 2b14922b |
13 | 18954521 |
14 | dcd7323 |
15 | 9313b7b |
hex | 63ffe03 |
104857091 has 4 divisors (see below), whose sum is σ = 107295672. Its totient is φ = 102418512.
The previous prime is 104857087. The next prime is 104857099. The reversal of 104857091 is 190758401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 190758401 = 131 ⋅1456171.
It is a cyclic number.
It is not a de Polignac number, because 104857091 - 22 = 104857087 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (104857099) 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, 1219226 + ... + 1219311.
It is an arithmetic number, because the mean of its divisors is an integer number (26823918).
Almost surely, 2104857091 is an apocalyptic number.
104857091 is a deficient number, since it is larger than the sum of its proper divisors (2438581).
104857091 is an equidigital number, since it uses as much as digits as its factorization.
104857091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2438580.
The product of its (nonzero) digits is 10080, while the sum is 35.
The square root of 104857091 is about 10239.9751464542. The cubic root of 104857091 is about 471.5552688153. Note that the first 3 decimals are identical.
It can be divided in two parts, 10485 and 7091, that added together give a cube (17576 = 263).
The spelling of 104857091 in words is "one hundred four million, eight hundred fifty-seven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •