Base | Representation |
---|---|
bin | 1001000111000100100… |
… | …11001000100111000101 |
3 | 1002220222220021200121100 |
4 | 10203202103020213011 |
5 | 20112043240442013 |
6 | 355450031410313 |
7 | 31421165515344 |
oct | 4434223104705 |
9 | 1086886250540 |
10 | 313034312133 |
11 | 110836787994 |
12 | 50802683999 |
13 | 2369935523a |
14 | 1121827db5b |
15 | 8221b3c473 |
hex | 48e24c89c5 |
313034312133 has 12 divisors (see below), whose sum is σ = 456386475168. Its totient is φ = 206739171240.
The previous prime is 313034312131. The next prime is 313034312161. The reversal of 313034312133 is 331213430313.
313034312133 is a `hidden beast` number, since 3 + 13 + 0 + 3 + 431 + 213 + 3 = 666.
It is not a de Polignac number, because 313034312133 - 21 = 313034312131 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 313034312097 and 313034312106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313034312131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 162529833 + ... + 162531758.
It is an arithmetic number, because the mean of its divisors is an integer number (38032206264).
Almost surely, 2313034312133 is an apocalyptic number.
It is an amenable number.
313034312133 is a deficient number, since it is larger than the sum of its proper divisors (143352163035).
313034312133 is a wasteful number, since it uses less digits than its factorization.
313034312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325061704 (or 325061701 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 313034312133 its reverse (331213430313), we get a palindrome (644247742446).
The spelling of 313034312133 in words is "three hundred thirteen billion, thirty-four million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •