Base | Representation |
---|---|
bin | 111101111111011000… |
… | …0010111100010111100 |
3 | 110201121120121201122022 |
4 | 1323332300113202330 |
5 | 4140114004023400 |
6 | 141053402135312 |
7 | 12421625526350 |
oct | 1737660274274 |
9 | 421546551568 |
10 | 133123111100 |
11 | 51503586791 |
12 | 219727b1538 |
13 | c726c32075 |
14 | 662c19b460 |
15 | 36e2124b85 |
hex | 1efec178bc |
133123111100 has 72 divisors (see below), whose sum is σ = 330480181248. Its totient is φ = 45595915200.
The previous prime is 133123111081. The next prime is 133123111123. The reversal of 133123111100 is 1111321331.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 597749 + ... + 789651.
Almost surely, 2133123111100 is an apocalyptic number.
133123111100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133123111100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165240090624).
133123111100 is an abundant number, since it is smaller than the sum of its proper divisors (197357070148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133123111100 is a wasteful number, since it uses less digits than its factorization.
133123111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192915 (or 192908 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133123111100 its reverse (1111321331), we get a palindrome (134234432431).
The spelling of 133123111100 in words is "one hundred thirty-three billion, one hundred twenty-three million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •