Base | Representation |
---|---|
bin | 10000100110100… |
… | …01100110100111 |
3 | 100201001200022011 |
4 | 20103101212213 |
5 | 241123124232 |
6 | 21453015051 |
7 | 3310531432 |
oct | 1023214647 |
9 | 321050264 |
10 | 139270567 |
11 | 71684047 |
12 | 3a784487 |
13 | 22b13327 |
14 | 146d4819 |
15 | c360547 |
hex | 84d19a7 |
139270567 has 4 divisors (see below), whose sum is σ = 139691656. Its totient is φ = 138849480.
The previous prime is 139270559. The next prime is 139270577. The reversal of 139270567 is 765072931.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 765072931 = 7 ⋅109296133.
It is a cyclic number.
It is not a de Polignac number, because 139270567 - 23 = 139270559 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139270517) 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 3 ways as a sum of consecutive naturals, for example, 210048 + ... + 210709.
It is an arithmetic number, because the mean of its divisors is an integer number (34922914).
Almost surely, 2139270567 is an apocalyptic number.
139270567 is a deficient number, since it is larger than the sum of its proper divisors (421089).
139270567 is an equidigital number, since it uses as much as digits as its factorization.
139270567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421088.
The product of its (nonzero) digits is 79380, while the sum is 40.
The square root of 139270567 is about 11801.2951407886. The cubic root of 139270567 is about 518.3460354916.
The spelling of 139270567 in words is "one hundred thirty-nine million, two hundred seventy thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •