Base | Representation |
---|---|
bin | 111111110110101… |
… | …1000100100010111 |
3 | 12112022200112111210 |
4 | 1333231120210113 |
5 | 13342001303133 |
6 | 552335232503 |
7 | 104044554363 |
oct | 17755304427 |
9 | 5468615453 |
10 | 2142603543 |
11 | 9aa497833 |
12 | 4b9678733 |
13 | 281b86762 |
14 | 1647ba2a3 |
15 | c8180763 |
hex | 7fb58917 |
2142603543 has 8 divisors (see below), whose sum is σ = 2926483056. Its totient is φ = 1393563200.
The previous prime is 2142603539. The next prime is 2142603557. The reversal of 2142603543 is 3453062412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2142603543 - 22 = 2142603539 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2142603543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2142603503) 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 7 ways as a sum of consecutive naturals, for example, 8709648 + ... + 8709893.
It is an arithmetic number, because the mean of its divisors is an integer number (365810382).
Almost surely, 22142603543 is an apocalyptic number.
2142603543 is a deficient number, since it is larger than the sum of its proper divisors (783879513).
2142603543 is a wasteful number, since it uses less digits than its factorization.
2142603543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17419585.
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 2142603543 is about 46288.2657160538. The cubic root of 2142603543 is about 1289.1811286420.
Adding to 2142603543 its reverse (3453062412), we get a palindrome (5595665955).
The spelling of 2142603543 in words is "two billion, one hundred forty-two million, six hundred three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •