Base | Representation |
---|---|
bin | 1000010011000000111… |
… | …0011100000010100001 |
3 | 111121221001211021101212 |
4 | 2010300032130002201 |
5 | 4313412002341001 |
6 | 145252223235505 |
7 | 13204230416315 |
oct | 2046016340241 |
9 | 447831737355 |
10 | 142543012001 |
11 | 554a78a5755 |
12 | 23761448b95 |
13 | 105986a0c20 |
14 | 6c83277b45 |
15 | 3a940e67bb |
hex | 213039c0a1 |
142543012001 has 4 divisors (see below), whose sum is σ = 153507859092. Its totient is φ = 131578164912.
The previous prime is 142543011983. The next prime is 142543012009. The reversal of 142543012001 is 100210345241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35564302225 + 106978709776 = 188585^2 + 327076^2 .
It is a cyclic number.
It is not a de Polignac number, because 142543012001 - 210 = 142543010977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142543012009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5482423526 + ... + 5482423551.
It is an arithmetic number, because the mean of its divisors is an integer number (38376964773).
Almost surely, 2142543012001 is an apocalyptic number.
It is an amenable number.
142543012001 is a deficient number, since it is larger than the sum of its proper divisors (10964847091).
142543012001 is a wasteful number, since it uses less digits than its factorization.
142543012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10964847090.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 142543012001 its reverse (100210345241), we get a palindrome (242753357242).
The spelling of 142543012001 in words is "one hundred forty-two billion, five hundred forty-three million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •