Base | Representation |
---|---|
bin | 101110110111001000111… |
… | …101101100010010111001 |
3 | 102101212011101120112002101 |
4 | 232313020331230102321 |
5 | 410230134320320441 |
6 | 10503215242303401 |
7 | 451442042244502 |
oct | 56671075542271 |
9 | 12355141515071 |
10 | 3220302120121 |
11 | 10317a4659249 |
12 | 4401487b7b61 |
13 | 1a4899cb77b8 |
14 | b1c13465ba9 |
15 | 58b7a211231 |
hex | 2edc8f6c4b9 |
3220302120121 has 8 divisors (see below), whose sum is σ = 3258343112040. Its totient is φ = 3182302413312.
The previous prime is 3220302120083. The next prime is 3220302120127. The reversal of 3220302120121 is 1210212030223.
It can be written as a sum of positive squares in 4 ways, for example, as 149270186025 + 3071031934096 = 386355^2 + 1752436^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3220302120121 - 29 = 3220302119609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3220302120127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10164340 + ... + 10476373.
It is an arithmetic number, because the mean of its divisors is an integer number (407292889005).
Almost surely, 23220302120121 is an apocalyptic number.
It is an amenable number.
3220302120121 is a deficient number, since it is larger than the sum of its proper divisors (38040991919).
3220302120121 is a wasteful number, since it uses less digits than its factorization.
3220302120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20642555.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 3220302120121 its reverse (1210212030223), we get a palindrome (4430514150344).
The spelling of 3220302120121 in words is "three trillion, two hundred twenty billion, three hundred two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •