Base | Representation |
---|---|
bin | 101101001000010100101… |
… | …010101110011001100101 |
3 | 101222111000211210122100021 |
4 | 231020110222232121211 |
5 | 401302442130212013 |
6 | 10332420143315141 |
7 | 440030300446126 |
oct | 55102452563145 |
9 | 11874024718307 |
10 | 3101313132133 |
11 | a96294459447 |
12 | 42107b5abab1 |
13 | 1965b63c49b8 |
14 | aa1664d604d |
15 | 55a13db4a8d |
hex | 2d214aae665 |
3101313132133 has 8 divisors (see below), whose sum is σ = 3116426762880. Its totient is φ = 3086203421280.
The previous prime is 3101313132119. The next prime is 3101313132143. The reversal of 3101313132133 is 3312313131013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3101313132133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3101313132098 and 3101313132107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101313132103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 612516 + ... + 2564722.
It is an arithmetic number, because the mean of its divisors is an integer number (389553345360).
Almost surely, 23101313132133 is an apocalyptic number.
It is an amenable number.
3101313132133 is a deficient number, since it is larger than the sum of its proper divisors (15113630747).
3101313132133 is a wasteful number, since it uses less digits than its factorization.
3101313132133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1959947.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 3101313132133 its reverse (3312313131013), we get a palindrome (6413626263146).
The spelling of 3101313132133 in words is "three trillion, one hundred one billion, three hundred thirteen million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •