Base | Representation |
---|---|
bin | 11110010010110011001011… |
… | …100101110010000011001100 |
3 | 122110201222102211122112122212 |
4 | 132102303023211302003030 |
5 | 114430343300101413400 |
6 | 1151210311131525552 |
7 | 40030534256355452 |
oct | 3622631345620314 |
9 | 573658384575585 |
10 | 133233301201100 |
11 | 394a7a20163401 |
12 | 12b3960abb98b8 |
13 | 5945b006ac279 |
14 | 24c8751bd09d2 |
15 | 1060a85ac9335 |
hex | 792ccb9720cc |
133233301201100 has 36 divisors (see below), whose sum is σ = 289748903232264. Its totient is φ = 53176704881280.
The previous prime is 133233301201067. The next prime is 133233301201129. The reversal of 133233301201100 is 1102103332331.
It is a super-2 number, since 2×1332333012011002 (a number of 29 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 1457649062 + ... + 1457740461.
Almost surely, 2133233301201100 is an apocalyptic number.
133233301201100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133233301201100 is an abundant number, since it is smaller than the sum of its proper divisors (156515602031164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133233301201100 is a wasteful number, since it uses less digits than its factorization.
133233301201100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2915389994 (or 2915389987 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 133233301201100 its reverse (1102103332331), we get a palindrome (134335404533431).
The spelling of 133233301201100 in words is "one hundred thirty-three trillion, two hundred thirty-three billion, three hundred one million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •