Base | Representation |
---|---|
bin | 110000000011011010011… |
… | …101010111110011111001 |
3 | 102200200112222220200221210 |
4 | 300003122131113303321 |
5 | 413100401201003441 |
6 | 11005002034353333 |
7 | 460401411003546 |
oct | 60033235276371 |
9 | 12620488820853 |
10 | 3302200016121 |
11 | 1063500903716 |
12 | 453ba412b849 |
13 | 1ac51c3975a6 |
14 | b5b822bbbcd |
15 | 5ad70124616 |
hex | 300da757cf9 |
3302200016121 has 4 divisors (see below), whose sum is σ = 4402933354832. Its totient is φ = 2201466677412.
The previous prime is 3302200016057. The next prime is 3302200016123. The reversal of 3302200016121 is 1216100022033.
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 not a de Polignac number, because 3302200016121 - 26 = 3302200016057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3302200016123) 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 3 ways as a sum of consecutive naturals, for example, 550366669351 + ... + 550366669356.
It is an arithmetic number, because the mean of its divisors is an integer number (1100733338708).
Almost surely, 23302200016121 is an apocalyptic number.
It is an amenable number.
3302200016121 is a deficient number, since it is larger than the sum of its proper divisors (1100733338711).
3302200016121 is a wasteful number, since it uses less digits than its factorization.
3302200016121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100733338710.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3302200016121 its reverse (1216100022033), we get a palindrome (4518300038154).
The spelling of 3302200016121 in words is "three trillion, three hundred two billion, two hundred million, sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •