Base | Representation |
---|---|
bin | 101101100101111100100… |
… | …000101100101101100001 |
3 | 102002112010112020021220222 |
4 | 231211330200230231201 |
5 | 402313112221332223 |
6 | 10355200245212425 |
7 | 442234431324302 |
oct | 55457440545541 |
9 | 12075115207828 |
10 | 3133120105313 |
11 | aa882668a140 |
12 | 427277701115 |
13 | 1995b4c4baa3 |
14 | ab9029107a9 |
15 | 567764730c8 |
hex | 2d97c82cb61 |
3133120105313 has 8 divisors (see below), whose sum is σ = 3417991853760. Its totient is φ = 2848255464880.
The previous prime is 3133120105273. The next prime is 3133120105327. The reversal of 3133120105313 is 3135010213313.
3133120105313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3133120105313 - 28 = 3133120105057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3133120105333) 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, 833573 + ... + 2638386.
It is an arithmetic number, because the mean of its divisors is an integer number (427248981720).
Almost surely, 23133120105313 is an apocalyptic number.
It is an amenable number.
3133120105313 is a deficient number, since it is larger than the sum of its proper divisors (284871748447).
3133120105313 is a wasteful number, since it uses less digits than its factorization.
3133120105313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3554007.
The product of its (nonzero) digits is 2430, while the sum is 26.
Adding to 3133120105313 its reverse (3135010213313), we get a palindrome (6268130318626).
The spelling of 3133120105313 in words is "three trillion, one hundred thirty-three billion, one hundred twenty million, one hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •