Base | Representation |
---|---|
bin | 100011100101101010101010… |
… | …1111011110100010100100001 |
3 | 1112001101100022002222111111200 |
4 | 1013023111111323310110201 |
5 | 312012322143034104441 |
6 | 3025440352444431413 |
7 | 122636255215210251 |
oct | 10713252573642441 |
9 | 1461340262874450 |
10 | 313040133113121 |
11 | 908206362260a7 |
12 | 2b139337248569 |
13 | 105897338ab23b |
14 | 574331a999961 |
15 | 262cd5b5237b6 |
hex | 11cb555ef4521 |
313040133113121 has 24 divisors (see below), whose sum is σ = 471048402071520. Its totient is φ = 200152434552000.
The previous prime is 313040133113053. The next prime is 313040133113143. The reversal of 313040133113121 is 121311331040313.
313040133113121 is a `hidden beast` number, since 3 + 1 + 30 + 4 + 0 + 1 + 3 + 311 + 312 + 1 = 666.
It is not a de Polignac number, because 313040133113121 - 211 = 313040133111073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (313040133113171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7189361655 + ... + 7189405196.
It is an arithmetic number, because the mean of its divisors is an integer number (19627016752980).
Almost surely, 2313040133113121 is an apocalyptic number.
It is an amenable number.
313040133113121 is a deficient number, since it is larger than the sum of its proper divisors (158008268958399).
313040133113121 is a wasteful number, since it uses less digits than its factorization.
313040133113121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14378766957 (or 14378766954 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 313040133113121 its reverse (121311331040313), we get a palindrome (434351464153434).
The spelling of 313040133113121 in words is "three hundred thirteen trillion, forty billion, one hundred thirty-three million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •