Base | Representation |
---|---|
bin | 11101100101100000000… |
… | …000101000111000101101 |
3 | 21012100212100101001001112 |
4 | 131211200000220320231 |
5 | 231302322324424323 |
6 | 4154001314321405 |
7 | 266613602334461 |
oct | 35454000507055 |
9 | 7170770331045 |
10 | 2033130311213 |
11 | 714278069a81 |
12 | 28a04b289265 |
13 | 119953308011 |
14 | 705929424a1 |
15 | 37d4683b178 |
hex | 1d960028e2d |
2033130311213 has 8 divisors (see below), whose sum is σ = 2037320482176. Its totient is φ = 2028940729200.
The previous prime is 2033130311183. The next prime is 2033130311287. The reversal of 2033130311213 is 3121130313302.
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 2033130311213 - 28 = 2033130310957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2033130311413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7134128 + ... + 7413638.
It is an arithmetic number, because the mean of its divisors is an integer number (254665060272).
Almost surely, 22033130311213 is an apocalyptic number.
It is an amenable number.
2033130311213 is a deficient number, since it is larger than the sum of its proper divisors (4190170963).
2033130311213 is a wasteful number, since it uses less digits than its factorization.
2033130311213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294475.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 2033130311213 its reverse (3121130313302), we get a palindrome (5154260624515).
The spelling of 2033130311213 in words is "two trillion, thirty-three billion, one hundred thirty million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •