Base | Representation |
---|---|
bin | 1000010101000111000… |
… | …0011001011000010101 |
3 | 111200101021100210002221 |
4 | 2011101300121120111 |
5 | 4321040010442013 |
6 | 145424120502341 |
7 | 13224201131212 |
oct | 2052160313025 |
9 | 450337323087 |
10 | 143105562133 |
11 | 557663a4a16 |
12 | 2389991a9b1 |
13 | 106580b6921 |
14 | 6cd7c72b09 |
15 | 3ac86b808d |
hex | 2151c19615 |
143105562133 has 4 divisors (see below), whose sum is σ = 143699361388. Its totient is φ = 142511762880.
The previous prime is 143105561999. The next prime is 143105562137. The reversal of 143105562133 is 331265501341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 331265501341 = 1151 ⋅287806691.
It can be written as a sum of positive squares in 2 ways, for example, as 62391047524 + 80714514609 = 249782^2 + 284103^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143105562133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143105562137) 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, 296899266 + ... + 296899747.
It is an arithmetic number, because the mean of its divisors is an integer number (35924840347).
Almost surely, 2143105562133 is an apocalyptic number.
It is an amenable number.
143105562133 is a deficient number, since it is larger than the sum of its proper divisors (593799255).
143105562133 is an equidigital number, since it uses as much as digits as its factorization.
143105562133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593799254.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 143105562133 in words is "one hundred forty-three billion, one hundred five million, five hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •