Base | Representation |
---|---|
bin | 1000010011010100000… |
… | …0000110101010111111 |
3 | 111122010122121020002122 |
4 | 2010311000012222333 |
5 | 4314043010444133 |
6 | 145304204513155 |
7 | 13206222456242 |
oct | 2046500065277 |
9 | 448118536078 |
10 | 142623140543 |
11 | 55539054494 |
12 | 2378424b7bb |
13 | 105ac177970 |
14 | 6c8db75259 |
15 | 3a9b173498 |
hex | 2135006abf |
142623140543 has 4 divisors (see below), whose sum is σ = 153594151368. Its totient is φ = 131652129720.
The previous prime is 142623140479. The next prime is 142623140581. The reversal of 142623140543 is 345041326241.
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 142623140543 - 26 = 142623140479 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 (142623140593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5485505393 + ... + 5485505418.
It is an arithmetic number, because the mean of its divisors is an integer number (38398537842).
Almost surely, 2142623140543 is an apocalyptic number.
142623140543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
142623140543 is a deficient number, since it is larger than the sum of its proper divisors (10971010825).
142623140543 is a wasteful number, since it uses less digits than its factorization.
142623140543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10971010824.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 142623140543 its reverse (345041326241), we get a palindrome (487664466784).
The spelling of 142623140543 in words is "one hundred forty-two billion, six hundred twenty-three million, one hundred forty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •