Base | Representation |
---|---|
bin | 10010101010111… |
… | …101110010100111 |
3 | 210211102220101010 |
4 | 102222331302213 |
5 | 1120143044111 |
6 | 51030033303 |
7 | 10522415100 |
oct | 2252756247 |
9 | 724386333 |
10 | 313253031 |
11 | 150906703 |
12 | 88aa8833 |
13 | 4cb8b230 |
14 | 2d8633a7 |
15 | 1c77aaa6 |
hex | 12abdca7 |
313253031 has 48 divisors (see below), whose sum is σ = 546061824. Its totient is φ = 158026176.
The previous prime is 313253027. The next prime is 313253053. The reversal of 313253031 is 130352313.
It is not a de Polignac number, because 313253031 - 22 = 313253027 is a prime.
It is a super-2 number, since 2×3132530312 = 196254922861373922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a zygodrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 313252989 and 313253007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313253011) 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 47 ways as a sum of consecutive naturals, for example, 40390 + ... + 47516.
It is an arithmetic number, because the mean of its divisors is an integer number (11376288).
Almost surely, 2313253031 is an apocalyptic number.
313253031 is a deficient number, since it is larger than the sum of its proper divisors (232808793).
313253031 is a wasteful number, since it uses less digits than its factorization.
313253031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7180 (or 7173 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 21.
The square root of 313253031 is about 17698.9556471561. The cubic root of 313253031 is about 679.1490444062.
The spelling of 313253031 in words is "three hundred thirteen million, two hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •