Base | Representation |
---|---|
bin | 1100100000000… |
… | …10000110110111 |
3 | 21022022202102111 |
4 | 12100002012313 |
5 | 203321204411 |
6 | 14223351451 |
7 | 2412230311 |
oct | 620020667 |
9 | 238282374 |
10 | 104866231 |
11 | 54215608 |
12 | 2b152587 |
13 | 18958732 |
14 | dcda7b1 |
15 | 9316721 |
hex | 64021b7 |
104866231 has 4 divisors (see below), whose sum is σ = 105136200. Its totient is φ = 104596264.
The previous prime is 104866193. The next prime is 104866241. The reversal of 104866231 is 132668401.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104866231 is a prime.
It is a super-2 number, since 2×1048662312 = 21993852808290722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104866193 and 104866202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104866241) 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 3 ways as a sum of consecutive naturals, for example, 134401 + ... + 135178.
It is an arithmetic number, because the mean of its divisors is an integer number (26284050).
Almost surely, 2104866231 is an apocalyptic number.
104866231 is a deficient number, since it is larger than the sum of its proper divisors (269969).
104866231 is an equidigital number, since it uses as much as digits as its factorization.
104866231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269968.
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 104866231 is about 10240.4214268750. The cubic root of 104866231 is about 471.5689696529.
The spelling of 104866231 in words is "one hundred four million, eight hundred sixty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •