Base | Representation |
---|---|
bin | 1001000111000001111… |
… | …10110101010110001101 |
3 | 1002220221100200221110212 |
4 | 10203200332311112031 |
5 | 20112022111310013 |
6 | 355443522012205 |
7 | 31420506624644 |
oct | 4434076652615 |
9 | 1086840627425 |
10 | 313012213133 |
11 | 110825263654 |
12 | 507b71a7065 |
13 | 236948b85c9 |
14 | 1121536a35b |
15 | 821ec246a8 |
hex | 48e0fb558d |
313012213133 has 4 divisors (see below), whose sum is σ = 329486540160. Its totient is φ = 296537886108.
The previous prime is 313012213121. The next prime is 313012213147. The reversal of 313012213133 is 331312210313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 313012213133 - 216 = 313012147597 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313012213099 and 313012213108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313012218133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8237163485 + ... + 8237163522.
It is an arithmetic number, because the mean of its divisors is an integer number (82371635040).
Almost surely, 2313012213133 is an apocalyptic number.
It is an amenable number.
313012213133 is a deficient number, since it is larger than the sum of its proper divisors (16474327027).
313012213133 is a wasteful number, since it uses less digits than its factorization.
313012213133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16474327026.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 313012213133 its reverse (331312210313), we get a palindrome (644324423446).
The spelling of 313012213133 in words is "three hundred thirteen billion, twelve million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •