Base | Representation |
---|---|
bin | 10000100110101… |
… | …01110001111001 |
3 | 100201002112202201 |
4 | 20103111301321 |
5 | 241124201143 |
6 | 21453230201 |
7 | 3310632340 |
oct | 1023256171 |
9 | 321075681 |
10 | 139287673 |
11 | 71695988 |
12 | 3a792361 |
13 | 22b1b055 |
14 | 146dab57 |
15 | c36564d |
hex | 84d5c79 |
139287673 has 4 divisors (see below), whose sum is σ = 159185920. Its totient is φ = 119389428.
The previous prime is 139287671. The next prime is 139287677. The reversal of 139287673 is 376782931.
It is a happy number.
139287673 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 376782931 = 7 ⋅53826133.
It is a cyclic number.
It is not a de Polignac number, because 139287673 - 21 = 139287671 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (139287671) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9949113 + ... + 9949126.
It is an arithmetic number, because the mean of its divisors is an integer number (39796480).
Almost surely, 2139287673 is an apocalyptic number.
It is an amenable number.
139287673 is a deficient number, since it is larger than the sum of its proper divisors (19898247).
139287673 is an equidigital number, since it uses as much as digits as its factorization.
139287673 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19898246.
The product of its digits is 381024, while the sum is 46.
The square root of 139287673 is about 11802.0198694969. The cubic root of 139287673 is about 518.3672566883.
The spelling of 139287673 in words is "one hundred thirty-nine million, two hundred eighty-seven thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •