Base | Representation |
---|---|
bin | 10000010101111010000… |
… | …000001100000101111111 |
3 | 10222100202010100101011111 |
4 | 100111322000030011333 |
5 | 121344433013143033 |
6 | 2215525301502451 |
7 | 144064545560140 |
oct | 20257200140577 |
9 | 3870663311144 |
10 | 1123033334143 |
11 | 3a3304048936 |
12 | 161799711a27 |
13 | 81b94a38b86 |
14 | 3c4d8591ac7 |
15 | 1e32cb977cd |
hex | 1057a00c17f |
1123033334143 has 4 divisors (see below), whose sum is σ = 1283466667600. Its totient is φ = 962600000688.
The previous prime is 1123033334081. The next prime is 1123033334161. The reversal of 1123033334143 is 3414333303211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123033334143 is a prime.
It is a super-2 number, since 2×11230333341432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123033334543) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80216666718 + ... + 80216666731.
It is an arithmetic number, because the mean of its divisors is an integer number (320866666900).
Almost surely, 21123033334143 is an apocalyptic number.
1123033334143 is a deficient number, since it is larger than the sum of its proper divisors (160433333457).
1123033334143 is an equidigital number, since it uses as much as digits as its factorization.
1123033334143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160433333456.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 1123033334143 its reverse (3414333303211), we get a palindrome (4537366637354).
The spelling of 1123033334143 in words is "one trillion, one hundred twenty-three billion, thirty-three million, three hundred thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •