Base | Representation |
---|---|
bin | 101101001000010100011… |
… | …111001111100010010101 |
3 | 101222111000122010201101210 |
4 | 231020110133033202111 |
5 | 401302440342402013 |
6 | 10332415555012033 |
7 | 440030233041456 |
oct | 55102437174225 |
9 | 11874018121353 |
10 | 3101310122133 |
11 | a96292792a43 |
12 | 42107a59a019 |
13 | 1965b58ac932 |
14 | aa165d5112d |
15 | 55a139bccc3 |
hex | 2d2147cf895 |
3101310122133 has 16 divisors (see below), whose sum is σ = 4178446253696. Its totient is φ = 2045887994880.
The previous prime is 3101310122117. The next prime is 3101310122161. The reversal of 3101310122133 is 3312210131013.
It is a happy number.
3101310122133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3101310122133 - 24 = 3101310122117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101310122173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3468388 + ... + 4269933.
It is an arithmetic number, because the mean of its divisors is an integer number (261152890856).
Almost surely, 23101310122133 is an apocalyptic number.
It is an amenable number.
3101310122133 is a deficient number, since it is larger than the sum of its proper divisors (1077136131563).
3101310122133 is a wasteful number, since it uses less digits than its factorization.
3101310122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7739724.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3101310122133 its reverse (3312210131013), we get a palindrome (6413520253146).
The spelling of 3101310122133 in words is "three trillion, one hundred one billion, three hundred ten million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •