Base | Representation |
---|---|
bin | 100001011000011… |
… | …1011100101111101 |
3 | 2220001201011020201 |
4 | 1002300323211331 |
5 | 4243222421021 |
6 | 303052043501 |
7 | 36520614325 |
oct | 10260734575 |
9 | 2801634221 |
10 | 1120123261 |
11 | 52530a204 |
12 | 273163591 |
13 | 14b0a823a |
14 | a8a9a285 |
15 | 6850d591 |
hex | 42c3b97d |
1120123261 has 2 divisors, whose sum is σ = 1120123262. Its totient is φ = 1120123260.
The previous prime is 1120123243. The next prime is 1120123331. The reversal of 1120123261 is 1623210211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 625950361 + 494172900 = 25019^2 + 22230^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120123261 - 27 = 1120123133 is a prime.
It is a super-2 number, since 2×11201232612 = 2509352239666548242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120123241) 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, 560061630 + 560061631.
It is an arithmetic number, because the mean of its divisors is an integer number (560061631).
Almost surely, 21120123261 is an apocalyptic number.
It is an amenable number.
1120123261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120123261 is an equidigital number, since it uses as much as digits as its factorization.
1120123261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1120123261 is about 33468.2425741179. The cubic root of 1120123261 is about 1038.5369161165.
Adding to 1120123261 its reverse (1623210211), we get a palindrome (2743333472).
The spelling of 1120123261 in words is "one billion, one hundred twenty million, one hundred twenty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •