Base | Representation |
---|---|
bin | 1011110000101000011… |
… | …1001010100011100001 |
3 | 201022111000221112122111 |
4 | 2330022013022203201 |
5 | 11302230434111223 |
6 | 232451314435321 |
7 | 20411366062033 |
oct | 2741207124341 |
9 | 638430845574 |
10 | 202033113313 |
11 | 78755475339 |
12 | 331a4592b41 |
13 | 160895bb5c5 |
14 | 9ac8119c53 |
15 | 53c6bc830d |
hex | 2f0a1ca8e1 |
202033113313 has 8 divisors (see below), whose sum is σ = 206348175360. Its totient is φ = 197718738240.
The previous prime is 202033113287. The next prime is 202033113329. The reversal of 202033113313 is 313311330202.
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-202033113313 is a prime.
It is a super-3 number, since 3×2020331133133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202033110313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 446208 + ... + 776638.
It is an arithmetic number, because the mean of its divisors is an integer number (25793521920).
Almost surely, 2202033113313 is an apocalyptic number.
It is an amenable number.
202033113313 is a deficient number, since it is larger than the sum of its proper divisors (4315062047).
202033113313 is a wasteful number, since it uses less digits than its factorization.
202033113313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343487.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 202033113313 its reverse (313311330202), we get a palindrome (515344443515).
The spelling of 202033113313 in words is "two hundred two billion, thirty-three million, one hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •