Base | Representation |
---|---|
bin | 11110010000111000010110… |
… | …110111010011100110101100 |
3 | 122110021101000211002110110101 |
4 | 132100320112313103212230 |
5 | 114421213202021200022 |
6 | 1151025540454120444 |
7 | 40015155161453410 |
oct | 3620702667234654 |
9 | 573241024073411 |
10 | 133101420100012 |
11 | 39456aa4777181 |
12 | 12b17b44350124 |
13 | 5936543b90090 |
14 | 24c220097ad40 |
15 | 105c417a3c627 |
hex | 790e16dd39ac |
133101420100012 has 96 divisors (see below), whose sum is σ = 288162044577792. Its totient is φ = 52383341074176.
The previous prime is 133101420100001. The next prime is 133101420100069. The reversal of 133101420100012 is 210001024101331.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 824776443 + ... + 824937805.
It is an arithmetic number, because the mean of its divisors is an integer number (3001687964352).
Almost surely, 2133101420100012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133101420100012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144081022288896).
133101420100012 is an abundant number, since it is smaller than the sum of its proper divisors (155060624477780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133101420100012 is a wasteful number, since it uses less digits than its factorization.
133101420100012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173087 (or 173085 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 133101420100012 its reverse (210001024101331), we get a palindrome (343102444201343).
The spelling of 133101420100012 in words is "one hundred thirty-three trillion, one hundred one billion, four hundred twenty million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •