Base | Representation |
---|---|
bin | 10000100101000… |
… | …00011011011001 |
3 | 100200200110000002 |
4 | 20102200123121 |
5 | 241100203040 |
6 | 21444422345 |
7 | 3306032255 |
oct | 1022403331 |
9 | 320613002 |
10 | 139069145 |
11 | 71556786 |
12 | 3a6a79b5 |
13 | 22a72747 |
14 | 14681265 |
15 | c320a15 |
hex | 84a06d9 |
139069145 has 8 divisors (see below), whose sum is σ = 167339904. Its totient is φ = 110950704.
The previous prime is 139069141. The next prime is 139069157. The reversal of 139069145 is 541960931.
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 139069145 - 22 = 139069141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 139069099 and 139069108.
It is not an unprimeable number, because it can be changed into a prime (139069141) 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, 36059 + ... + 39728.
It is an arithmetic number, because the mean of its divisors is an integer number (20917488).
Almost surely, 2139069145 is an apocalyptic number.
It is an amenable number.
139069145 is a deficient number, since it is larger than the sum of its proper divisors (28270759).
139069145 is an equidigital number, since it uses as much as digits as its factorization.
139069145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76159.
The product of its (nonzero) digits is 29160, while the sum is 38.
The square root of 139069145 is about 11792.7581591416. The cubic root of 139069145 is about 518.0960265320.
The spelling of 139069145 in words is "one hundred thirty-nine million, sixty-nine thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •