Base | Representation |
---|---|
bin | 1111000111110110101110… |
… | …11101000000101101000011 |
3 | 11100202011121122201100101210 |
4 | 13203323113131000231003 |
5 | 13324323223341342011 |
6 | 154421130204301203 |
7 | 10001420063611125 |
oct | 743732735005503 |
9 | 140664548640353 |
10 | 33255251512131 |
11 | a661522574850 |
12 | 3891110541803 |
13 | 1572c5900b65c |
14 | 82d7c4307215 |
15 | 3ca0a33c06a6 |
hex | 1e3ed7740b43 |
33255251512131 has 64 divisors (see below), whose sum is σ = 48745682399232. Its totient is φ = 19999386000000.
The previous prime is 33255251512129. The next prime is 33255251512199. The reversal of 33255251512131 is 13121515255233.
It is not a de Polignac number, because 33255251512131 - 21 = 33255251512129 is a prime.
It is a super-2 number, since 2×332552515121312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 33255251512131.
It is not an unprimeable number, because it can be changed into a prime (33255251513131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4773249210 + ... + 4773256176.
It is an arithmetic number, because the mean of its divisors is an integer number (761651287488).
Almost surely, 233255251512131 is an apocalyptic number.
33255251512131 is a deficient number, since it is larger than the sum of its proper divisors (15490430887101).
33255251512131 is a wasteful number, since it uses less digits than its factorization.
33255251512131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9304.
The product of its digits is 135000, while the sum is 39.
Adding to 33255251512131 its reverse (13121515255233), we get a palindrome (46376766767364).
The spelling of 33255251512131 in words is "thirty-three trillion, two hundred fifty-five billion, two hundred fifty-one million, five hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •