Base | Representation |
---|---|
bin | 10000111011010… |
… | …11111110100011 |
3 | 100220012100102120 |
4 | 20131223332203 |
5 | 242323000120 |
6 | 22031315323 |
7 | 3342660162 |
oct | 1035537643 |
9 | 326170376 |
10 | 142000035 |
11 | 73178801 |
12 | 3b67bb43 |
13 | 2355a7b8 |
14 | 14c053d9 |
15 | c6ee140 |
hex | 876bfa3 |
142000035 has 16 divisors (see below), whose sum is σ = 227494656. Its totient is φ = 75635168.
The previous prime is 142000003. The next prime is 142000039. The reversal of 142000035 is 530000241.
It is a cyclic number.
It is not a de Polignac number, because 142000035 - 25 = 142000003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 141999978 and 142000023.
It is not an unprimeable number, because it can be changed into a prime (142000039) 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 15 ways as a sum of consecutive naturals, for example, 6682 + ... + 18128.
It is an arithmetic number, because the mean of its divisors is an integer number (14218416).
Almost surely, 2142000035 is an apocalyptic number.
142000035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
142000035 is a deficient number, since it is larger than the sum of its proper divisors (85494621).
142000035 is a wasteful number, since it uses less digits than its factorization.
142000035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12282.
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 142000035 is about 11916.3767563803. The cubic root of 142000035 is about 521.7103874911.
Adding to 142000035 its reverse (530000241), we get a palindrome (672000276).
The spelling of 142000035 in words is "one hundred forty-two million, thirty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •