Base | Representation |
---|---|
bin | 10000100110111… |
… | …00110100001101 |
3 | 100201011000022010 |
4 | 20103130310031 |
5 | 241131111433 |
6 | 21454011433 |
7 | 3311112351 |
oct | 1023346415 |
9 | 321130263 |
10 | 139316493 |
11 | 717055a8 |
12 | 3a7a6b79 |
13 | 22b2b1c4 |
14 | 14707461 |
15 | c36de63 |
hex | 84dcd0d |
139316493 has 32 divisors (see below), whose sum is σ = 203673600. Its totient is φ = 84369600.
The previous prime is 139316477. The next prime is 139316509. The reversal of 139316493 is 394613931.
It is an interprime number because it is at equal distance from previous prime (139316477) and next prime (139316509).
It is not a de Polignac number, because 139316493 - 24 = 139316477 is a prime.
It is a Smith number, since the sum of its digits (39) 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 (139316693) 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 31 ways as a sum of consecutive naturals, for example, 447808 + ... + 448118.
It is an arithmetic number, because the mean of its divisors is an integer number (6364800).
Almost surely, 2139316493 is an apocalyptic number.
It is an amenable number.
139316493 is a deficient number, since it is larger than the sum of its proper divisors (64357107).
139316493 is a wasteful number, since it uses less digits than its factorization.
139316493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633.
The product of its digits is 52488, while the sum is 39.
The square root of 139316493 is about 11803.2407837848. The cubic root of 139316493 is about 518.4030059970.
The spelling of 139316493 in words is "one hundred thirty-nine million, three hundred sixteen thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •