Base | Representation |
---|---|
bin | 11110001111101111100110… |
… | …101110111111010110011001 |
3 | 122102222220101201100220000221 |
4 | 132033233212232333112121 |
5 | 114413423211104432301 |
6 | 1150530021210000041 |
7 | 40006421314002556 |
oct | 3617574656772631 |
9 | 572886351326027 |
10 | 133023303202201 |
11 | 394269588246a5 |
12 | 12b04983116021 |
13 | 592c074c23719 |
14 | 24bc50dd4ba2d |
15 | 105a394a3eda1 |
hex | 78fbe6bbf599 |
133023303202201 has 4 divisors (see below), whose sum is σ = 133023326850304. Its totient is φ = 133023279554100.
The previous prime is 133023303202199. The next prime is 133023303202217. The reversal of 133023303202201 is 102202303320331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133023303202201 - 21 = 133023303202199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133023303202271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2004856 + ... + 16433686.
It is an arithmetic number, because the mean of its divisors is an integer number (33255831712576).
Almost surely, 2133023303202201 is an apocalyptic number.
It is an amenable number.
133023303202201 is a deficient number, since it is larger than the sum of its proper divisors (23648103).
133023303202201 is an equidigital number, since it uses as much as digits as its factorization.
133023303202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23648102.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 133023303202201 its reverse (102202303320331), we get a palindrome (235225606522532).
The spelling of 133023303202201 in words is "one hundred thirty-three trillion, twenty-three billion, three hundred three million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.192 sec. • engine limits •