Base | Representation |
---|---|
bin | 10010101010111… |
… | …010101101011101 |
3 | 210211102021001210 |
4 | 102222322231131 |
5 | 1120142143123 |
6 | 51025455033 |
7 | 10522333233 |
oct | 2252725535 |
9 | 724367053 |
10 | 313240413 |
11 | 1508a8182 |
12 | 88aa1479 |
13 | 4cb85575 |
14 | 2d85c953 |
15 | 1c776e93 |
hex | 12abab5d |
313240413 has 8 divisors (see below), whose sum is σ = 418852000. Its totient is φ = 208227888.
The previous prime is 313240379. The next prime is 313240439. The reversal of 313240413 is 314042313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313240413 - 26 = 313240349 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 313240413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313241413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 148543 + ... + 150636.
It is an arithmetic number, because the mean of its divisors is an integer number (52356500).
Almost surely, 2313240413 is an apocalyptic number.
It is an amenable number.
313240413 is a deficient number, since it is larger than the sum of its proper divisors (105611587).
313240413 is a wasteful number, since it uses less digits than its factorization.
313240413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299531.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 313240413 is about 17698.5991818562. The cubic root of 313240413 is about 679.1399254546.
Adding to 313240413 its reverse (314042313), we get a palindrome (627282726).
The spelling of 313240413 in words is "three hundred thirteen million, two hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •