Base | Representation |
---|---|
bin | 11110010000111000001010… |
… | …011001110001000111110011 |
3 | 122110021100111020200121022201 |
4 | 132100320022121301013303 |
5 | 114421212240010430003 |
6 | 1151025504025044031 |
7 | 40015150042422016 |
oct | 3620701231610763 |
9 | 573240436617281 |
10 | 133101211030003 |
11 | 394569a7759847 |
12 | 12b17aa6326617 |
13 | 593650c77b608 |
14 | 24c21c0cb737d |
15 | 105c4044e0b1d |
hex | 790e0a6711f3 |
133101211030003 has 8 divisors (see below), whose sum is σ = 134473693331600. Its totient is φ = 131728734950400.
The previous prime is 133101211029989. The next prime is 133101211030049. The reversal of 133101211030003 is 300030112101331.
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-133101211030003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133101211030703) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 50324203 + ... + 52903003.
It is an arithmetic number, because the mean of its divisors is an integer number (16809211666450).
Almost surely, 2133101211030003 is an apocalyptic number.
133101211030003 is a deficient number, since it is larger than the sum of its proper divisors (1372482301597).
133101211030003 is an equidigital number, since it uses as much as digits as its factorization.
133101211030003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3110997.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 133101211030003 its reverse (300030112101331), we get a palindrome (433131323131334).
The spelling of 133101211030003 in words is "one hundred thirty-three trillion, one hundred one billion, two hundred eleven million, thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •