Base | Representation |
---|---|
bin | 1100011001100… |
… | …11011010010001 |
3 | 21020201202001211 |
4 | 12030303122101 |
5 | 203112111401 |
6 | 14153300121 |
7 | 2402103100 |
oct | 614633221 |
9 | 236652054 |
10 | 104019601 |
11 | 53797514 |
12 | 2aa04641 |
13 | 1872027a |
14 | db5a037 |
15 | 91ea951 |
hex | 6333691 |
104019601 has 27 divisors (see below), whose sum is σ = 127748457. Its totient is φ = 84447720.
The previous prime is 104019563. The next prime is 104019611. The reversal of 104019601 is 106910401.
The square root of 104019601 is 10199.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 104019601 - 211 = 104017553 is a prime.
It is a hoax number, since the sum of its digits (22) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104019611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2213160 + ... + 2213206.
Almost surely, 2104019601 is an apocalyptic number.
104019601 is the 10199-th square number.
104019601 is the 5100-th centered octagonal number.
It is an amenable number.
104019601 is a deficient number, since it is larger than the sum of its proper divisors (23728856).
104019601 is an frugal number, since it uses more digits than its factorization.
104019601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170 (or 85 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
The cubic root of 104019601 is about 470.2964796057.
It can be divided in two parts, 10401 and 9601, that added together give a palindrome (20002).
The spelling of 104019601 in words is "one hundred four million, nineteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •