Base | Representation |
---|---|
bin | 10011000010011… |
… | …110001101000101 |
3 | 211021000222011020 |
4 | 103002132031011 |
5 | 1123232240414 |
6 | 51410101353 |
7 | 10625661246 |
oct | 2302361505 |
9 | 737028136 |
10 | 319415109 |
11 | 154335332 |
12 | 8ab7a859 |
13 | 51237c30 |
14 | 305c8ccd |
15 | 1d0967a9 |
hex | 1309e345 |
319415109 has 8 divisors (see below), whose sum is σ = 458647392. Its totient is φ = 196563120.
The previous prime is 319415101. The next prime is 319415119. The reversal of 319415109 is 901514913.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 319415109 - 23 = 319415101 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 319415109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (319415101) 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, 4095027 + ... + 4095104.
It is an arithmetic number, because the mean of its divisors is an integer number (57330924).
Almost surely, 2319415109 is an apocalyptic number.
319415109 is a gapful number since it is divisible by the number (39) formed by its first and last digit.
It is an amenable number.
319415109 is a deficient number, since it is larger than the sum of its proper divisors (139232283).
319415109 is a wasteful number, since it uses less digits than its factorization.
319415109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8190147.
The product of its (nonzero) digits is 4860, while the sum is 33.
The square root of 319415109 is about 17872.1881424743. The cubic root of 319415109 is about 683.5733955400.
The spelling of 319415109 in words is "three hundred nineteen million, four hundred fifteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •