Base | Representation |
---|---|
bin | 100010011100111… |
… | …1111010010101111 |
3 | 2222120022112102001 |
4 | 1010321333102233 |
5 | 4331422132033 |
6 | 310414113131 |
7 | 40435165261 |
oct | 10471772257 |
9 | 2876275361 |
10 | 1156052143 |
11 | 54361a0a4 |
12 | 2831ab7a7 |
13 | 155677a2c |
14 | ad76db31 |
15 | 6b758e7d |
hex | 44e7f4af |
1156052143 has 4 divisors (see below), whose sum is σ = 1195916040. Its totient is φ = 1116188248.
The previous prime is 1156052141. The next prime is 1156052153. The reversal of 1156052143 is 3412506511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3412506511 = 67 ⋅50932933.
It is a cyclic number.
It is not a de Polignac number, because 1156052143 - 21 = 1156052141 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 (1156052141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19931905 + ... + 19931962.
It is an arithmetic number, because the mean of its divisors is an integer number (298979010).
Almost surely, 21156052143 is an apocalyptic number.
1156052143 is a deficient number, since it is larger than the sum of its proper divisors (39863897).
1156052143 is an equidigital number, since it uses as much as digits as its factorization.
1156052143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39863896.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 1156052143 is about 34000.7668001767. The cubic root of 1156052143 is about 1049.5242419104.
Adding to 1156052143 its reverse (3412506511), we get a palindrome (4568558654).
The spelling of 1156052143 in words is "one billion, one hundred fifty-six million, fifty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •