Base | Representation |
---|---|
bin | 111101111100000010… |
… | …0110100110010010000 |
3 | 110201022202201120201011 |
4 | 1323320010310302100 |
5 | 4134401311030412 |
6 | 141034320020304 |
7 | 12416065061620 |
oct | 1737004646220 |
9 | 421282646634 |
10 | 133011033232 |
11 | 51456295a50 |
12 | 21941161694 |
13 | c70994ccbc |
14 | 661b344880 |
15 | 36d73867a7 |
hex | 1ef8134c90 |
133011033232 has 40 divisors (see below), whose sum is σ = 321299381952. Its totient is φ = 51822480000.
The previous prime is 133011033217. The next prime is 133011033257. The reversal of 133011033232 is 232330110331.
133011033232 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-4 number, since 4×1330110332324 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53980519 + ... + 53982982.
Almost surely, 2133011033232 is an apocalyptic number.
It is an amenable number.
133011033232 is an abundant number, since it is smaller than the sum of its proper divisors (188288348720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133011033232 is a wasteful number, since it uses less digits than its factorization.
133011033232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107963527 (or 107963521 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133011033232 its reverse (232330110331), we get a palindrome (365341143563).
The spelling of 133011033232 in words is "one hundred thirty-three billion, eleven million, thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •