Base | Representation |
---|---|
bin | 10000111111101… |
… | …00101100000001 |
3 | 100221020210120001 |
4 | 20133310230001 |
5 | 242443410001 |
6 | 22051320001 |
7 | 3350511553 |
oct | 1037645401 |
9 | 327223501 |
10 | 142560001 |
11 | 73520491 |
12 | 3b8b0001 |
13 | 236c563c |
14 | 14d0d4d3 |
15 | c7b0001 |
hex | 87f4b01 |
142560001 has 4 divisors (see below), whose sum is σ = 146413012. Its totient is φ = 138706992.
The previous prime is 142559999. The next prime is 142560073. The reversal of 142560001 is 100065241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100065241 = 31 ⋅3227911.
It can be written as a sum of positive squares in 2 ways, for example, as 122766400 + 19793601 = 11080^2 + 4449^2 .
It is a cyclic number.
It is not a de Polignac number, because 142560001 - 21 = 142559999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142560091) 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, 1926450 + ... + 1926523.
It is an arithmetic number, because the mean of its divisors is an integer number (36603253).
Almost surely, 2142560001 is an apocalyptic number.
It is an amenable number.
142560001 is a deficient number, since it is larger than the sum of its proper divisors (3853011).
142560001 is an equidigital number, since it uses as much as digits as its factorization.
142560001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3853010.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 142560001 is about 11939.8492871560. The cubic root of 142560001 is about 522.3952626919.
The spelling of 142560001 in words is "one hundred forty-two million, five hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •