Base | Representation |
---|---|
bin | 10000010101111111111… |
… | …000111101100001011111 |
3 | 10222101000000012100020002 |
4 | 100111333320331201133 |
5 | 121400133304242001 |
6 | 2215543150444515 |
7 | 144100155233231 |
oct | 20257770754137 |
9 | 3871000170202 |
10 | 1123132102751 |
11 | 3a335487918a |
12 | 16180680373b |
13 | 81bac33b039 |
14 | 3c507742251 |
15 | 1e3366a746b |
hex | 1057fe3d85f |
1123132102751 has 2 divisors, whose sum is σ = 1123132102752. Its totient is φ = 1123132102750.
The previous prime is 1123132102733. The next prime is 1123132102787. The reversal of 1123132102751 is 1572012313211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123132102751 is a prime.
It is a super-2 number, since 2×11231321027512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123132102721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561566051375 + 561566051376.
It is an arithmetic number, because the mean of its divisors is an integer number (561566051376).
Almost surely, 21123132102751 is an apocalyptic number.
1123132102751 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123132102751 is an equidigital number, since it uses as much as digits as its factorization.
1123132102751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 1123132102751 its reverse (1572012313211), we get a palindrome (2695144415962).
The spelling of 1123132102751 in words is "one trillion, one hundred twenty-three billion, one hundred thirty-two million, one hundred two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •