Base | Representation |
---|---|
bin | 11110001111100100010001… |
… | …001010011100011000101000 |
3 | 122102221201222100121021020202 |
4 | 132033210101022130120220 |
5 | 114413223243303441300 |
6 | 1150520245235011332 |
7 | 40005510541455104 |
oct | 3617442112343050 |
9 | 572851870537222 |
10 | 133011130140200 |
11 | 39421781409a84 |
12 | 12b02546439b48 |
13 | 592ab84c76c60 |
14 | 24bbab7360904 |
15 | 1059dd0ed6ad5 |
hex | 78f91129c628 |
133011130140200 has 96 divisors (see below), whose sum is σ = 333044802127800. Its totient is φ = 49111006248960.
The previous prime is 133011130140199. The next prime is 133011130140211. The reversal of 133011130140200 is 2041031110331.
It can be written as a sum of positive squares in 12 ways, for example, as 5314214446564 + 127696915693636 = 2305258^2 + 11300306^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 174258584 + ... + 175020216.
Almost surely, 2133011130140200 is an apocalyptic number.
133011130140200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133011130140200 is an abundant number, since it is smaller than the sum of its proper divisors (200033671987600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133011130140200 is a wasteful number, since it uses less digits than its factorization.
133011130140200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828831 (or 828822 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 133011130140200 its reverse (2041031110331), we get a palindrome (135052161250531).
The spelling of 133011130140200 in words is "one hundred thirty-three trillion, eleven billion, one hundred thirty million, one hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •