Base | Representation |
---|---|
bin | 10010011100001… |
… | …001100100110011 |
3 | 210120010120200021 |
4 | 102130021210303 |
5 | 1113144303024 |
6 | 50410504311 |
7 | 10444410562 |
oct | 2234114463 |
9 | 716116607 |
10 | 309369139 |
11 | 1496a3682 |
12 | 87735097 |
13 | 4c12b481 |
14 | 2d131bd9 |
15 | 1c25ede4 |
hex | 12709933 |
309369139 has 2 divisors, whose sum is σ = 309369140. Its totient is φ = 309369138.
The previous prime is 309369131. The next prime is 309369143. The reversal of 309369139 is 931963903.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 309369139 - 23 = 309369131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 309369095 and 309369104.
It is not a weakly prime, because it can be changed into another prime (309369131) 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 as a sum of consecutive naturals, namely, 154684569 + 154684570.
It is an arithmetic number, because the mean of its divisors is an integer number (154684570).
Almost surely, 2309369139 is an apocalyptic number.
309369139 is a deficient number, since it is larger than the sum of its proper divisors (1).
309369139 is an equidigital number, since it uses as much as digits as its factorization.
309369139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 118098, while the sum is 43.
The square root of 309369139 is about 17588.8924892956. The cubic root of 309369139 is about 676.3305362472.
The spelling of 309369139 in words is "three hundred nine million, three hundred sixty-nine thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •