Base | Representation |
---|---|
bin | 11110001111101110100110… |
… | …111100110111111110101000 |
3 | 122102222210122010210002001111 |
4 | 132033232212330313332220 |
5 | 114413414013133201300 |
6 | 1150525323102000104 |
7 | 40006352641201633 |
oct | 3617564674677650 |
9 | 572883563702044 |
10 | 133022233100200 |
11 | 39426459780184 |
12 | 12b04724876034 |
13 | 592bc34310482 |
14 | 24bc44bb92c1a |
15 | 105a330b129ba |
hex | 78fba6f37fa8 |
133022233100200 has 48 divisors (see below), whose sum is σ = 310895941743360. Its totient is φ = 52930312632000.
The previous prime is 133022233100153. The next prime is 133022233100219. The reversal of 133022233100200 is 2001332220331.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1741090506 + ... + 1741166905.
It is an arithmetic number, because the mean of its divisors is an integer number (6476998786320).
Almost surely, 2133022233100200 is an apocalyptic number.
133022233100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133022233100200 is an abundant number, since it is smaller than the sum of its proper divisors (177873708643160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133022233100200 is a wasteful number, since it uses less digits than its factorization.
133022233100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3482257618 (or 3482257609 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 133022233100200 its reverse (2001332220331), we get a palindrome (135023565320531).
The spelling of 133022233100200 in words is "one hundred thirty-three trillion, twenty-two billion, two hundred thirty-three million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •