Base | Representation |
---|---|
bin | 1000101111000110… |
… | …0000011110110001 |
3 | 20001102112220111202 |
4 | 2023301200132301 |
5 | 14300310323441 |
6 | 1024405420545 |
7 | 112053160055 |
oct | 21361403661 |
9 | 6042486452 |
10 | 2345011121 |
11 | aa3774622 |
12 | 55540a755 |
13 | 2b4aa485b |
14 | 183627c65 |
15 | dad1319b |
hex | 8bc607b1 |
2345011121 has 2 divisors, whose sum is σ = 2345011122. Its totient is φ = 2345011120.
The previous prime is 2345011117. The next prime is 2345011139. The reversal of 2345011121 is 1211105432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2286274225 + 58736896 = 47815^2 + 7664^2 .
It is a cyclic number.
It is not a de Polignac number, because 2345011121 - 22 = 2345011117 is a prime.
It is a super-2 number, since 2×23450111212 = 10998154315227353282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2345011093 and 2345011102.
It is not a weakly prime, because it can be changed into another prime (2345011111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1172505560 + 1172505561.
It is an arithmetic number, because the mean of its divisors is an integer number (1172505561).
Almost surely, 22345011121 is an apocalyptic number.
It is an amenable number.
2345011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2345011121 is an equidigital number, since it uses as much as digits as its factorization.
2345011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 2345011121 is about 48425.3148776546. The cubic root of 2345011121 is about 1328.5614160547.
Adding to 2345011121 its reverse (1211105432), we get a palindrome (3556116553).
The spelling of 2345011121 in words is "two billion, three hundred forty-five million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •