Base | Representation |
---|---|
bin | 11110001111110111111010… |
… | …010010110110010011001011 |
3 | 122110000202102020100101211222 |
4 | 132033313322102312103023 |
5 | 114414044442123212021 |
6 | 1150534054143512255 |
7 | 40010155313423441 |
oct | 3617677222662313 |
9 | 573022366311758 |
10 | 133032221304011 |
11 | 3942a714868577 |
12 | 12b066518b868b |
13 | 592cb6672a643 |
14 | 24bcb18524b91 |
15 | 105a7179406ab |
hex | 78fdfa4b64cb |
133032221304011 has 16 divisors (see below), whose sum is σ = 135707278749696. Its totient is φ = 130373914500000.
The previous prime is 133032221303963. The next prime is 133032221304061. The reversal of 133032221304011 is 110403122230331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 133032221304011 - 214 = 133032221287627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133032221304061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16375706 + ... + 23113376.
It is an arithmetic number, because the mean of its divisors is an integer number (8481704921856).
Almost surely, 2133032221304011 is an apocalyptic number.
133032221304011 is a deficient number, since it is larger than the sum of its proper divisors (2675057445685).
133032221304011 is an equidigital number, since it uses as much as digits as its factorization.
133032221304011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6738914.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 133032221304011 its reverse (110403122230331), we get a palindrome (243435343534342).
The spelling of 133032221304011 in words is "one hundred thirty-three trillion, thirty-two billion, two hundred twenty-one million, three hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •