Base | Representation |
---|---|
bin | 10010101010011… |
… | …101111001111001 |
3 | 210211012021012212 |
4 | 102222131321321 |
5 | 1120124404200 |
6 | 51023144505 |
7 | 10521332240 |
oct | 2252357171 |
9 | 724167185 |
10 | 313122425 |
11 | 150827570 |
12 | 88a45135 |
13 | 4cb43955 |
14 | 2d82b957 |
15 | 1c752035 |
hex | 12a9de79 |
313122425 has 96 divisors (see below), whose sum is σ = 514252800. Its totient is φ = 183456000.
The previous prime is 313122401. The next prime is 313122427. The reversal of 313122425 is 524221313.
It is not a de Polignac number, because 313122425 - 28 = 313122169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313122425.
It is not an unprimeable number, because it can be changed into a prime (313122427) 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 95 ways as a sum of consecutive naturals, for example, 3963536 + ... + 3963614.
It is an arithmetic number, because the mean of its divisors is an integer number (5356800).
Almost surely, 2313122425 is an apocalyptic number.
313122425 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
313122425 is a deficient number, since it is larger than the sum of its proper divisors (201130375).
313122425 is a wasteful number, since it uses less digits than its factorization.
313122425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207 (or 202 counting only the distinct ones).
The product of its digits is 1440, while the sum is 23.
The square root of 313122425 is about 17695.2656097613. The cubic root of 313122425 is about 679.0546443934.
Adding to 313122425 its reverse (524221313), we get a palindrome (837343738).
The spelling of 313122425 in words is "three hundred thirteen million, one hundred twenty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •