Base | Representation |
---|---|
bin | 11110001111110101111101… |
… | …110101011010001101100000 |
3 | 122110000120000201020100002211 |
4 | 132033311331311122031200 |
5 | 114414031203100241000 |
6 | 1150533111032451504 |
7 | 40010052500063563 |
oct | 3617657565321540 |
9 | 573016021210084 |
10 | 133030133212000 |
11 | 394298431230a2 |
12 | 12b0616a549b94 |
13 | 592c8c2c4b93b |
14 | 24bc99b0984da |
15 | 105a64447b7ba |
hex | 78fd7dd5a360 |
133030133212000 has 48 divisors (see below), whose sum is σ = 326855037311712. Its totient is φ = 53212053283200.
The previous prime is 133030133211991. The next prime is 133030133212003. The reversal of 133030133212000 is 212331030331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133030133212003) 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, 16628762652 + ... + 16628770651.
It is an arithmetic number, because the mean of its divisors is an integer number (6809479943994).
Almost surely, 2133030133212000 is an apocalyptic number.
133030133212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133030133212000 is an abundant number, since it is smaller than the sum of its proper divisors (193824904099712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133030133212000 is an equidigital number, since it uses as much as digits as its factorization.
133030133212000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33257533328 (or 33257533310 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133030133212000 its reverse (212331030331), we get a palindrome (133242464242331).
The spelling of 133030133212000 in words is "one hundred thirty-three trillion, thirty billion, one hundred thirty-three million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •