Base | Representation |
---|---|
bin | 110000001101100110101… |
… | …010011111111101011100 |
3 | 102201201210120120100102000 |
4 | 300031212222133331130 |
5 | 413240303400432304 |
6 | 11014011515402300 |
7 | 461236516025652 |
oct | 60154652377534 |
9 | 12651716510360 |
10 | 3313142202204 |
11 | 106810644400a |
12 | 456138753390 |
13 | 1b057432c003 |
14 | b64dd61cdd2 |
15 | 5b2b0a93939 |
hex | 30366a9ff5c |
3313142202204 has 48 divisors (see below), whose sum is σ = 8589952926240. Its totient is φ = 1104338949120.
The previous prime is 3313142202133. The next prime is 3313142202211. The reversal of 3313142202204 is 4022022413133.
3313142202204 is a `hidden beast` number, since 3 + 3 + 1 + 31 + 422 + 0 + 2 + 204 = 666.
It is a super-2 number, since 2×33131422022042 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2355772 + ... + 3489404.
It is an arithmetic number, because the mean of its divisors is an integer number (178957352630).
Almost surely, 23313142202204 is an apocalyptic number.
It is an amenable number.
3313142202204 is an abundant number, since it is smaller than the sum of its proper divisors (5276810724036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3313142202204 is a wasteful number, since it uses less digits than its factorization.
3313142202204 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1160707 (or 1160699 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 3313142202204 its reverse (4022022413133), we get a palindrome (7335164615337).
The spelling of 3313142202204 in words is "three trillion, three hundred thirteen billion, one hundred forty-two million, two hundred two thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •