Base | Representation |
---|---|
bin | 10000100110011… |
… | …10011101000101 |
3 | 100201001000121110 |
4 | 20103032131011 |
5 | 241122221134 |
6 | 21452435233 |
7 | 3310446015 |
oct | 1023163505 |
9 | 321030543 |
10 | 139257669 |
11 | 71675391 |
12 | 3a778b19 |
13 | 22b0a4b5 |
14 | 146cdc45 |
15 | c35b7e9 |
hex | 84ce745 |
139257669 has 8 divisors (see below), whose sum is σ = 195449440. Its totient is φ = 87952176.
The previous prime is 139257661. The next prime is 139257719. The reversal of 139257669 is 966752931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 139257669 - 23 = 139257661 is a prime.
It is a super-2 number, since 2×1392576692 = 38785396750627122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139257661) 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, 1221502 + ... + 1221615.
It is an arithmetic number, because the mean of its divisors is an integer number (24431180).
Almost surely, 2139257669 is an apocalyptic number.
139257669 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
139257669 is a deficient number, since it is larger than the sum of its proper divisors (56191771).
139257669 is a wasteful number, since it uses less digits than its factorization.
139257669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2443139.
The product of its digits is 612360, while the sum is 48.
The square root of 139257669 is about 11800.7486626909. The cubic root of 139257669 is about 518.3300334659.
The spelling of 139257669 in words is "one hundred thirty-nine million, two hundred fifty-seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •