Base | Representation |
---|---|
bin | 1011100101100101… |
… | …0110010110101001 |
3 | 22000202211012222121 |
4 | 2321121112112221 |
5 | 22332232230441 |
6 | 1232351151241 |
7 | 140036135251 |
oct | 27131262651 |
9 | 8022735877 |
10 | 3110430121 |
11 | 1356836207 |
12 | 729815521 |
13 | 3a753a5c6 |
14 | 217150961 |
15 | 133108dd1 |
hex | b96565a9 |
3110430121 has 2 divisors, whose sum is σ = 3110430122. Its totient is φ = 3110430120.
The previous prime is 3110430101. The next prime is 3110430151. The reversal of 3110430121 is 1210340113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2566840896 + 543589225 = 50664^2 + 23315^2 .
It is a cyclic number.
It is not a de Polignac number, because 3110430121 - 211 = 3110428073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3110430095 and 3110430104.
It is not a weakly prime, because it can be changed into another prime (3110430101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555215060 + 1555215061.
It is an arithmetic number, because the mean of its divisors is an integer number (1555215061).
Almost surely, 23110430121 is an apocalyptic number.
It is an amenable number.
3110430121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3110430121 is an equidigital number, since it uses as much as digits as its factorization.
3110430121 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 3110430121 is about 55771.2302267038. The cubic root of 3110430121 is about 1459.7331909082.
Adding to 3110430121 its reverse (1210340113), we get a palindrome (4320770234).
The spelling of 3110430121 in words is "three billion, one hundred ten million, four hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •