Base | Representation |
---|---|
bin | 10000100010100… |
… | …10001000110111 |
3 | 100200002011010021 |
4 | 20101102020313 |
5 | 241004422341 |
6 | 21433510011 |
7 | 3303225331 |
oct | 1021221067 |
9 | 320064107 |
10 | 138748471 |
11 | 71357864 |
12 | 3a572307 |
13 | 2298c7b4 |
14 | 145da451 |
15 | c2aa9d1 |
hex | 8452237 |
138748471 has 8 divisors (see below), whose sum is σ = 141719760. Its totient is φ = 135797952.
The previous prime is 138748459. The next prime is 138748481. The reversal of 138748471 is 174847831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 6-Lehmer number, since φ(138748471) divides (138748471-1)6.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138748471 is a prime.
It is a super-3 number, since 3×1387484713 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138748451) 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, 8701 + ... + 18793.
It is an arithmetic number, because the mean of its divisors is an integer number (17714970).
Almost surely, 2138748471 is an apocalyptic number.
138748471 is a deficient number, since it is larger than the sum of its proper divisors (2971289).
138748471 is a wasteful number, since it uses less digits than its factorization.
138748471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10385.
The product of its digits is 150528, while the sum is 43.
The square root of 138748471 is about 11779.1540867755. The cubic root of 138748471 is about 517.6975010658.
The spelling of 138748471 in words is "one hundred thirty-eight million, seven hundred forty-eight thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •