Base | Representation |
---|---|
bin | 100011100110010101100000… |
… | …0011011000011100011101001 |
3 | 1112001201010201102020200201121 |
4 | 1013030223000123003203221 |
5 | 312020324032141000410 |
6 | 3025550523550215241 |
7 | 122646022456642441 |
oct | 10714530033034351 |
9 | 1461633642220647 |
10 | 313132114000105 |
11 | 90856647019974 |
12 | 2b1531274b4521 |
13 | 10595301c1509a |
14 | 57479649b9121 |
15 | 26304417399da |
hex | 11ccac06c38e9 |
313132114000105 has 32 divisors (see below), whose sum is σ = 394292748672000. Its totient is φ = 238271642592192.
The previous prime is 313132114000091. The next prime is 313132114000141. The reversal of 313132114000105 is 501000411231313.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313132114000105 is a prime.
It is a super-2 number, since 2×3131321140001052 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 313132114000105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2395761046 + ... + 2395891744.
It is an arithmetic number, because the mean of its divisors is an integer number (12321648396000).
Almost surely, 2313132114000105 is an apocalyptic number.
It is an amenable number.
313132114000105 is a deficient number, since it is larger than the sum of its proper divisors (81160634671895).
313132114000105 is a wasteful number, since it uses less digits than its factorization.
313132114000105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247293.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 313132114000105 its reverse (501000411231313), we get a palindrome (814132525231418).
The spelling of 313132114000105 in words is "three hundred thirteen trillion, one hundred thirty-two billion, one hundred fourteen million, one hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •