Base | Representation |
---|---|
bin | 1011100111111001… |
… | …0100010111101001 |
3 | 22001110001120210221 |
4 | 2321332110113221 |
5 | 22342222340241 |
6 | 1233335010041 |
7 | 140214410422 |
oct | 27176242751 |
9 | 8043046727 |
10 | 3120121321 |
11 | 1361255369 |
12 | 730b09921 |
13 | 3a9551745 |
14 | 218554649 |
15 | 133dc05d1 |
hex | b9f945e9 |
3120121321 has 2 divisors, whose sum is σ = 3120121322. Its totient is φ = 3120121320.
The previous prime is 3120121307. The next prime is 3120121357. The reversal of 3120121321 is 1231210213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1748159721 + 1371961600 = 41811^2 + 37040^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120121321 - 227 = 2985903593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3120121295 and 3120121304.
It is not a weakly prime, because it can be changed into another prime (3120121021) 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 as a sum of consecutive naturals, namely, 1560060660 + 1560060661.
It is an arithmetic number, because the mean of its divisors is an integer number (1560060661).
Almost surely, 23120121321 is an apocalyptic number.
It is an amenable number.
3120121321 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120121321 is an equidigital number, since it uses as much as digits as its factorization.
3120121321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 3120121321 is about 55858.0461616767. The cubic root of 3120121321 is about 1461.2476544954.
Adding to 3120121321 its reverse (1231210213), we get a palindrome (4351331534).
The spelling of 3120121321 in words is "three billion, one hundred twenty million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •