Base | Representation |
---|---|
bin | 10000100000101… |
… | …10100110011001 |
3 | 100122121202121001 |
4 | 20100112212121 |
5 | 240424121401 |
6 | 21424345001 |
7 | 3301161334 |
oct | 1020264631 |
9 | 318552531 |
10 | 138504601 |
11 | 71200614 |
12 | 3a475161 |
13 | 229057b1 |
14 | 1457561b |
15 | c25d601 |
hex | 8416999 |
138504601 has 8 divisors (see below), whose sum is σ = 142040808. Its totient is φ = 134976000.
The previous prime is 138504581. The next prime is 138504659. The reversal of 138504601 is 106405831.
It can be written as a sum of positive squares in 4 ways, for example, as 2175625 + 136328976 = 1475^2 + 11676^2 .
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 138504601 - 215 = 138471833 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 138504601.
It is not an unprimeable number, because it can be changed into a prime (138504101) 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 7 ways as a sum of consecutive naturals, for example, 59581 + ... + 61861.
It is an arithmetic number, because the mean of its divisors is an integer number (17755101).
Almost surely, 2138504601 is an apocalyptic number.
It is an amenable number.
138504601 is a deficient number, since it is larger than the sum of its proper divisors (3536207).
138504601 is a wasteful number, since it uses less digits than its factorization.
138504601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3803.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 138504601 is about 11768.7977720751. The cubic root of 138504601 is about 517.3940144066.
The spelling of 138504601 in words is "one hundred thirty-eight million, five hundred four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •