Base | Representation |
---|---|
bin | 10010101010000… |
… | …101101000100100 |
3 | 210211000012211220 |
4 | 102222011220210 |
5 | 1120113214022 |
6 | 51021100340 |
7 | 10520436351 |
oct | 2252055044 |
9 | 724005756 |
10 | 313023012 |
11 | 150769905 |
12 | 889b76b0 |
13 | 4cb0a623 |
14 | 2d803628 |
15 | 1c73285c |
hex | 12a85a24 |
313023012 has 24 divisors (see below), whose sum is σ = 733610976. Its totient is φ = 103880448.
The previous prime is 313023001. The next prime is 313023017. The reversal of 313023012 is 210320313.
313023012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 313022982 and 313023000.
It is not an unprimeable number, because it can be changed into a prime (313023017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54733 + ... + 60180.
It is an arithmetic number, because the mean of its divisors is an integer number (30567124).
Almost surely, 2313023012 is an apocalyptic number.
It is an amenable number.
313023012 is an abundant number, since it is smaller than the sum of its proper divisors (420587964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313023012 is a wasteful number, since it uses less digits than its factorization.
313023012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115147 (or 115145 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 313023012 is about 17692.4563585727. The cubic root of 313023012 is about 678.9827726062.
Adding to 313023012 its reverse (210320313), we get a palindrome (523343325).
The spelling of 313023012 in words is "three hundred thirteen million, twenty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •