Base | Representation |
---|---|
bin | 10010101010011… |
… | …001101110010101 |
3 | 210211011101201122 |
4 | 102222121232111 |
5 | 1120123332201 |
6 | 51022533325 |
7 | 10521231305 |
oct | 2252315625 |
9 | 724141648 |
10 | 313105301 |
11 | 150815713 |
12 | 88a37245 |
13 | 4cb38c12 |
14 | 2d825605 |
15 | 1c74be1b |
hex | 12a99b95 |
313105301 has 8 divisors (see below), whose sum is σ = 323533824. Its totient is φ = 302697360.
The previous prime is 313105277. The next prime is 313105307. The reversal of 313105301 is 103501313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 313105301 - 222 = 308910997 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 313105301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313105307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29615 + ... + 38771.
It is an arithmetic number, because the mean of its divisors is an integer number (40441728).
Almost surely, 2313105301 is an apocalyptic number.
313105301 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
313105301 is a deficient number, since it is larger than the sum of its proper divisors (10428523).
313105301 is a wasteful number, since it uses less digits than its factorization.
313105301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10291.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 313105301 is about 17694.7817449100. The cubic root of 313105301 is about 679.0422654826.
Adding to 313105301 its reverse (103501313), we get a palindrome (416606614).
The spelling of 313105301 in words is "three hundred thirteen million, one hundred five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •