Base | Representation |
---|---|
bin | 10000100001101… |
… | …00000111011111 |
3 | 100122211220102220 |
4 | 20100310013133 |
5 | 240442004003 |
6 | 21431120423 |
7 | 3302203662 |
oct | 1020640737 |
9 | 318756386 |
10 | 138625503 |
11 | 71283435 |
12 | 3a513113 |
13 | 22948833 |
14 | 145a76d9 |
15 | c284353 |
hex | 84341df |
138625503 has 8 divisors (see below), whose sum is σ = 185212416. Its totient is φ = 92227800.
The previous prime is 138625483. The next prime is 138625519. The reversal of 138625503 is 305526831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 138625503 - 28 = 138625247 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138625103) 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 7 ways as a sum of consecutive naturals, for example, 45583 + ... + 48528.
It is an arithmetic number, because the mean of its divisors is an integer number (23151552).
Almost surely, 2138625503 is an apocalyptic number.
138625503 is a deficient number, since it is larger than the sum of its proper divisors (46586913).
138625503 is an equidigital number, since it uses as much as digits as its factorization.
138625503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94605.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 138625503 is about 11773.9332000823. The cubic root of 138625503 is about 517.5445166960.
It can be divided in two parts, 138625 and 503, that added together give a triangular number (139128 = T527).
The spelling of 138625503 in words is "one hundred thirty-eight million, six hundred twenty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •