Base | Representation |
---|---|
bin | 110000000011011010100… |
… | …001001100111011011001 |
3 | 102200200120001210201011222 |
4 | 300003122201030323121 |
5 | 413100401430120441 |
6 | 11005002112101425 |
7 | 460401422354633 |
oct | 60033241147331 |
9 | 12620501721158 |
10 | 3302201020121 |
11 | 1063501429a73 |
12 | 453ba4534875 |
13 | 1ac51c659583 |
14 | b5b8249da53 |
15 | 5ad70271d4b |
hex | 300da84ced9 |
3302201020121 has 16 divisors (see below), whose sum is σ = 3318667417728. Its totient is φ = 3285777792000.
The previous prime is 3302201020109. The next prime is 3302201020141. The reversal of 3302201020121 is 1210201022033.
It is a cyclic number.
It is not a de Polignac number, because 3302201020121 - 214 = 3302201003737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3302201020121.
It is not an unprimeable number, because it can be changed into a prime (3302201020141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 504380570 + ... + 504387116.
It is an arithmetic number, because the mean of its divisors is an integer number (207416713608).
Almost surely, 23302201020121 is an apocalyptic number.
It is an amenable number.
3302201020121 is a deficient number, since it is larger than the sum of its proper divisors (16466397607).
3302201020121 is a wasteful number, since it uses less digits than its factorization.
3302201020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9472.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 3302201020121 its reverse (1210201022033), we get a palindrome (4512402042154).
The spelling of 3302201020121 in words is "three trillion, three hundred two billion, two hundred one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •