Base | Representation |
---|---|
bin | 11110001111011010110101… |
… | …100010110110011101101011 |
3 | 122102220202211120210022202012 |
4 | 132033122311202312131223 |
5 | 114413042023243200021 |
6 | 1150511452313230135 |
7 | 40005001562160434 |
oct | 3617326542663553 |
9 | 572822746708665 |
10 | 133001003100011 |
11 | 39418454a14882 |
12 | 12b0059aa0234b |
13 | 5929c2cb69297 |
14 | 24bb3d63ac48b |
15 | 10599dbdd235b |
hex | 78f6b58b676b |
133001003100011 has 8 divisors (see below), whose sum is σ = 133568700462000. Its totient is φ = 132434512322560.
The previous prime is 133001003099933. The next prime is 133001003100047. The reversal of 133001003100011 is 110001300100331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133001003100011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133001003100211) 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 7 ways as a sum of consecutive naturals, for example, 301425206 + ... + 301866123.
It is an arithmetic number, because the mean of its divisors is an integer number (16696087557750).
Almost surely, 2133001003100011 is an apocalyptic number.
133001003100011 is a deficient number, since it is larger than the sum of its proper divisors (567697361989).
133001003100011 is an equidigital number, since it uses as much as digits as its factorization.
133001003100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603292269.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 133001003100011 its reverse (110001300100331), we get a palindrome (243002303200342).
The spelling of 133001003100011 in words is "one hundred thirty-three trillion, one billion, three million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •