Base | Representation |
---|---|
bin | 110000000001011110100… |
… | …110110111101011000101 |
3 | 102200111012012000012121211 |
4 | 300001132212313223011 |
5 | 413032122231144031 |
6 | 11004015530211421 |
7 | 460266050165053 |
oct | 60013646675305 |
9 | 12614165005554 |
10 | 3300122131141 |
11 | 10626349aaa00 |
12 | 453704283b71 |
13 | 1ac27aa50754 |
14 | b5a2634b1d3 |
15 | 5ac9c9c9bb1 |
hex | 3005e9b7ac5 |
3300122131141 has 6 divisors (see below), whose sum is σ = 3627406970726. Its totient is φ = 3000111028200.
The previous prime is 3300122131109. The next prime is 3300122131157. The reversal of 3300122131141 is 1411312210033.
3300122131141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1671665399041 + 1628456732100 = 1292929^2 + 1276110^2 .
It is not a de Polignac number, because 3300122131141 - 25 = 3300122131109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300122101141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13636868190 + ... + 13636868431.
Almost surely, 23300122131141 is an apocalyptic number.
It is an amenable number.
3300122131141 is a deficient number, since it is larger than the sum of its proper divisors (327284839585).
3300122131141 is a wasteful number, since it uses less digits than its factorization.
3300122131141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27273736643 (or 27273736632 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 3300122131141 its reverse (1411312210033), we get a palindrome (4711434341174).
The spelling of 3300122131141 in words is "three trillion, three hundred billion, one hundred twenty-two million, one hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •