Base | Representation |
---|---|
bin | 101110100101010001101… |
… | …100110010010010000101 |
3 | 102100000122122112102221201 |
4 | 232211101230302102011 |
5 | 404421344030032214 |
6 | 10450324055342501 |
7 | 450162525233500 |
oct | 56452154622205 |
9 | 12300578472851 |
10 | 3201121330309 |
11 | 10246515a0a41 |
12 | 438495081a31 |
13 | 1a2b3125a826 |
14 | b0d13caa137 |
15 | 58406364274 |
hex | 2e951b32485 |
3201121330309 has 6 divisors (see below), whose sum is σ = 3723753384294. Its totient is φ = 2743818283080.
The previous prime is 3201121330243. The next prime is 3201121330313. The reversal of 3201121330309 is 9030331211023.
It can be written as a sum of positive squares in only one way, i.e., 2166130481284 + 1034990849025 = 1471778^2 + 1017345^2 .
It is not a de Polignac number, because 3201121330309 - 29 = 3201121329797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201121330009) 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 5 ways as a sum of consecutive naturals, for example, 32664503322 + ... + 32664503419.
It is an arithmetic number, because the mean of its divisors is an integer number (620625564049).
Almost surely, 23201121330309 is an apocalyptic number.
It is an amenable number.
3201121330309 is a deficient number, since it is larger than the sum of its proper divisors (522632053985).
3201121330309 is an equidigital number, since it uses as much as digits as its factorization.
3201121330309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65329006755 (or 65329006748 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 3201121330309 in words is "three trillion, two hundred one billion, one hundred twenty-one million, three hundred thirty thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •