Base | Representation |
---|---|
bin | 11110010101100100000010… |
… | …101001001100010111000000 |
3 | 122111102010121110010221112110 |
4 | 132111210002221030113000 |
5 | 114442001210032400300 |
6 | 1151433435023055320 |
7 | 40050336234426444 |
oct | 3625440251142700 |
9 | 574363543127473 |
10 | 133423203403200 |
11 | 3957050aa92587 |
12 | 12b6a388a41540 |
13 | 595a9a598b8a9 |
14 | 24d3a08b72824 |
15 | 106599c7c3550 |
hex | 795902a4c5c0 |
133423203403200 has 168 divisors, whose sum is σ = 463488663634992. Its totient is φ = 33486607892480.
The previous prime is 133423203403187. The next prime is 133423203403241. The reversal of 133423203403200 is 2304302324331.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 817462539 + ... + 817625738.
Almost surely, 2133423203403200 is an apocalyptic number.
133423203403200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133423203403200 is an abundant number, since it is smaller than the sum of its proper divisors (330065460231792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133423203403200 is a wasteful number, since it uses less digits than its factorization.
133423203403200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1635088319 (or 1635088304 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 133423203403200 its reverse (2304302324331), we get a palindrome (135727505727531).
The spelling of 133423203403200 in words is "one hundred thirty-three trillion, four hundred twenty-three billion, two hundred three million, four hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •