Base | Representation |
---|---|
bin | 10010011110010… |
… | …010111111011111 |
3 | 210121012011202221 |
4 | 102132102333133 |
5 | 1113320310444 |
6 | 50430530211 |
7 | 10452243556 |
oct | 2236227737 |
9 | 717164687 |
10 | 309931999 |
11 | 149a48553 |
12 | 87966967 |
13 | 4c297720 |
14 | 2d23ad9d |
15 | 1c321a84 |
hex | 12792fdf |
309931999 has 4 divisors (see below), whose sum is σ = 333772936. Its totient is φ = 286091064.
The previous prime is 309931987. The next prime is 309932011. The reversal of 309931999 is 999139903.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 999139903 = 71 ⋅14072393.
It is an interprime number because it is at equal distance from previous prime (309931987) and next prime (309932011).
It is a cyclic number.
It is not a de Polignac number, because 309931999 - 25 = 309931967 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 (309931099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11920449 + ... + 11920474.
It is an arithmetic number, because the mean of its divisors is an integer number (83443234).
Almost surely, 2309931999 is an apocalyptic number.
309931999 is a deficient number, since it is larger than the sum of its proper divisors (23840937).
309931999 is a wasteful number, since it uses less digits than its factorization.
309931999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23840936.
The product of its (nonzero) digits is 531441, while the sum is 52.
The square root of 309931999 is about 17604.8856571123. The cubic root of 309931999 is about 676.7404551477.
The spelling of 309931999 in words is "three hundred nine million, nine hundred thirty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •