Base | Representation |
---|---|
bin | 111111001111110… |
… | …110100010001111 |
3 | 2201221200111012001 |
4 | 333033312202033 |
5 | 4133121321033 |
6 | 253143253131 |
7 | 35203241506 |
oct | 7717664217 |
9 | 2657614161 |
10 | 1061120143 |
11 | 4a4a7a2a6 |
12 | 25744a1a7 |
13 | 13bab9c55 |
14 | a0cdb83d |
15 | 63255e7d |
hex | 3f3f688f |
1061120143 has 4 divisors (see below), whose sum is σ = 1061320608. Its totient is φ = 1060919680.
The previous prime is 1061120141. The next prime is 1061120147. The reversal of 1061120143 is 3410211601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1061120143 - 21 = 1061120141 is a prime.
It is a super-2 number, since 2×10611201432 = 2251951915760680898, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1061120143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1061120141) 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, 92071 + ... + 102952.
It is an arithmetic number, because the mean of its divisors is an integer number (265330152).
Almost surely, 21061120143 is an apocalyptic number.
1061120143 is a deficient number, since it is larger than the sum of its proper divisors (200465).
1061120143 is an equidigital number, since it uses as much as digits as its factorization.
1061120143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200464.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1061120143 is about 32574.8391093494. The cubic root of 1061120143 is about 1019.9718507546.
Adding to 1061120143 its reverse (3410211601), we get a palindrome (4471331744).
The spelling of 1061120143 in words is "one billion, sixty-one million, one hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •