Base | Representation |
---|---|
bin | 10000111111001… |
… | …10000011001111 |
3 | 100221010202022112 |
4 | 20133212003033 |
5 | 242440000142 |
6 | 22050134235 |
7 | 3350142014 |
oct | 1037460317 |
9 | 327122275 |
10 | 142500047 |
11 | 7348a438 |
12 | 3b88137b |
13 | 236a4271 |
14 | 14cd570b |
15 | c79c382 |
hex | 87e60cf |
142500047 has 2 divisors, whose sum is σ = 142500048. Its totient is φ = 142500046.
The previous prime is 142500041. The next prime is 142500067. The reversal of 142500047 is 740005241.
It is a weak prime.
It is an emirp because it is prime and its reverse (740005241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142500047 - 218 = 142237903 is a prime.
It is a Chen prime.
It is equal to p8045420 and since 142500047 and 8045420 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 142499995 and 142500031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142500041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71250023 + 71250024.
It is an arithmetic number, because the mean of its divisors is an integer number (71250024).
Almost surely, 2142500047 is an apocalyptic number.
142500047 is a deficient number, since it is larger than the sum of its proper divisors (1).
142500047 is an equidigital number, since it uses as much as digits as its factorization.
142500047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 23.
The square root of 142500047 is about 11937.3383549265. The cubic root of 142500047 is about 522.3220208360.
Adding to 142500047 its reverse (740005241), we get a palindrome (882505288).
The spelling of 142500047 in words is "one hundred forty-two million, five hundred thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •