Base | Representation |
---|---|
bin | 10000111101010… |
… | …11011110000101 |
3 | 100220200120011122 |
4 | 20132223132011 |
5 | 242404310401 |
6 | 22041043325 |
7 | 3345122324 |
oct | 1036533605 |
9 | 326616148 |
10 | 142260101 |
11 | 73336135 |
12 | 3b786545 |
13 | 2361bc99 |
14 | 14c720bb |
15 | c75121b |
hex | 87ab785 |
142260101 has 4 divisors (see below), whose sum is σ = 142324332. Its totient is φ = 142195872.
The previous prime is 142260089. The next prime is 142260121. The reversal of 142260101 is 101062241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101062241 = 7 ⋅14437463.
It can be written as a sum of positive squares in 2 ways, for example, as 64802500 + 77457601 = 8050^2 + 8801^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142260101 is a prime.
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 142260101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142260121) 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, 28670 + ... + 33263.
It is an arithmetic number, because the mean of its divisors is an integer number (35581083).
Almost surely, 2142260101 is an apocalyptic number.
It is an amenable number.
142260101 is a deficient number, since it is larger than the sum of its proper divisors (64231).
142260101 is an equidigital number, since it uses as much as digits as its factorization.
142260101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64230.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 142260101 is about 11927.2838903080. The cubic root of 142260101 is about 522.0286887928.
The spelling of 142260101 in words is "one hundred forty-two million, two hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •