Base | Representation |
---|---|
bin | 1100011110001… |
… | …11110000111111 |
3 | 21021212121121211 |
4 | 12033013300333 |
5 | 203241033023 |
6 | 14214305251 |
7 | 2410213516 |
oct | 617076077 |
9 | 237777554 |
10 | 104627263 |
11 | 54072014 |
12 | 2b058227 |
13 | 188a3a30 |
14 | dc7767d |
15 | 92baa0d |
hex | 63c7c3f |
104627263 has 8 divisors (see below), whose sum is σ = 116310656. Its totient is φ = 93463200.
The previous prime is 104627239. The next prime is 104627279. The reversal of 104627263 is 362726401.
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 104627263 - 217 = 104496191 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104621263) 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 7 ways as a sum of consecutive naturals, for example, 129408 + ... + 130213.
It is an arithmetic number, because the mean of its divisors is an integer number (14538832).
Almost surely, 2104627263 is an apocalyptic number.
104627263 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104627263 is a deficient number, since it is larger than the sum of its proper divisors (11683393).
104627263 is a wasteful number, since it uses less digits than its factorization.
104627263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259665.
The product of its (nonzero) digits is 12096, while the sum is 31.
The square root of 104627263 is about 10228.7468929483. The cubic root of 104627263 is about 471.2104951792.
The spelling of 104627263 in words is "one hundred four million, six hundred twenty-seven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •