Base | Representation |
---|---|
bin | 101011111101101001100… |
… | …000011111001111010011 |
3 | 101200211001220002212122222 |
4 | 223331221200133033103 |
5 | 343444234311231311 |
6 | 10231520002251255 |
7 | 431161320266204 |
oct | 53755140371723 |
9 | 11624056085588 |
10 | 3021132133331 |
11 | a65289368284 |
12 | 409623056b2b |
13 | 18bb78929500 |
14 | a631b6c35ab |
15 | 538bea91adb |
hex | 2bf6981f3d3 |
3021132133331 has 12 divisors (see below), whose sum is σ = 3271457576880. Its totient is φ = 2788691199840.
The previous prime is 3021132133309. The next prime is 3021132133333. The reversal of 3021132133331 is 1333312311203.
It is not a de Polignac number, because 3021132133331 - 210 = 3021132132307 is a prime.
It is a super-2 number, since 2×30211321333312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3021132133331.
It is not an unprimeable number, because it can be changed into a prime (3021132133333) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14197025 + ... + 14408253.
It is an arithmetic number, because the mean of its divisors is an integer number (272621464740).
Almost surely, 23021132133331 is an apocalyptic number.
3021132133331 is a deficient number, since it is larger than the sum of its proper divisors (250325443549).
3021132133331 is a wasteful number, since it uses less digits than its factorization.
3021132133331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295886 (or 295873 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 3021132133331 its reverse (1333312311203), we get a palindrome (4354444444534).
The spelling of 3021132133331 in words is "three trillion, twenty-one billion, one hundred thirty-two million, one hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •