Base | Representation |
---|---|
bin | 110000000010100000001… |
… | …100100011110001001001 |
3 | 102200121000212121021020121 |
4 | 300002200030203301021 |
5 | 413041400431430441 |
6 | 11004321035423241 |
7 | 460335241342255 |
oct | 60024014436111 |
9 | 12617025537217 |
10 | 3301222530121 |
11 | 106304a067a4a |
12 | 4539708b4b21 |
13 | 1ac3c4a10bc9 |
14 | b5acc551265 |
15 | 5ad143dddd1 |
hex | 300a0323c49 |
3301222530121 has 2 divisors, whose sum is σ = 3301222530122. Its totient is φ = 3301222530120.
The previous prime is 3301222530061. The next prime is 3301222530173. The reversal of 3301222530121 is 1210352221033.
3301222530121 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2189334529600 + 1111888000521 = 1479640^2 + 1054461^2 .
It is a cyclic number.
It is not a de Polignac number, because 3301222530121 - 231 = 3299075046473 is a prime.
It is not a weakly prime, because it can be changed into another prime (3301222030121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650611265060 + 1650611265061.
It is an arithmetic number, because the mean of its divisors is an integer number (1650611265061).
Almost surely, 23301222530121 is an apocalyptic number.
It is an amenable number.
3301222530121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3301222530121 is an equidigital number, since it uses as much as digits as its factorization.
3301222530121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 3301222530121 its reverse (1210352221033), we get a palindrome (4511574751154).
The spelling of 3301222530121 in words is "three trillion, three hundred one billion, two hundred twenty-two million, five hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •