Base | Representation |
---|---|
bin | 111101111111010010… |
… | …0100101011001010100 |
3 | 110201121100210210022220 |
4 | 1323332210211121110 |
5 | 4140112211201400 |
6 | 141053212022340 |
7 | 12421560342462 |
oct | 1737644453124 |
9 | 421540723286 |
10 | 133120022100 |
11 | 5150186699a |
12 | 219717619b0 |
13 | c7263c0060 |
14 | 662b9d5832 |
15 | 36e1c147a0 |
hex | 1efe925654 |
133120022100 has 72 divisors (see below), whose sum is σ = 414788347680. Its totient is φ = 32768004480.
The previous prime is 133120022059. The next prime is 133120022137. The reversal of 133120022100 is 1220021331.
133120022100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 133120022100.
It is a congruent number.
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, 17062770 + ... + 17070569.
Almost surely, 2133120022100 is an apocalyptic number.
133120022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133120022100 is an abundant number, since it is smaller than the sum of its proper divisors (281668325580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133120022100 is a wasteful number, since it uses less digits than its factorization.
133120022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34133369 (or 34133362 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 133120022100 its reverse (1220021331), we get a palindrome (134340043431).
The spelling of 133120022100 in words is "one hundred thirty-three billion, one hundred twenty million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •