Base | Representation |
---|---|
bin | 1100100000000… |
… | …11011001010011 |
3 | 21022100000122220 |
4 | 12100003121103 |
5 | 203321342012 |
6 | 14223432123 |
7 | 2412251556 |
oct | 620033123 |
9 | 238300586 |
10 | 104871507 |
11 | 54219574 |
12 | 2b155643 |
13 | 1895ac60 |
14 | dcdc69d |
15 | 931808c |
hex | 6403653 |
104871507 has 32 divisors (see below), whose sum is σ = 159371520. Its totient is φ = 60808320.
The previous prime is 104871499. The next prime is 104871509. The reversal of 104871507 is 705178401.
It is not a de Polignac number, because 104871507 - 23 = 104871499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104871509) 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 31 ways as a sum of consecutive naturals, for example, 227257 + ... + 227717.
It is an arithmetic number, because the mean of its divisors is an integer number (4980360).
Almost surely, 2104871507 is an apocalyptic number.
104871507 is a deficient number, since it is larger than the sum of its proper divisors (54500013).
104871507 is a wasteful number, since it uses less digits than its factorization.
104871507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803.
The product of its (nonzero) digits is 7840, while the sum is 33.
The square root of 104871507 is about 10240.6790302206. The cubic root of 104871507 is about 471.5768780016.
The spelling of 104871507 in words is "one hundred four million, eight hundred seventy-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •