Base | Representation |
---|---|
bin | 10001000000010… |
… | …00010010110001 |
3 | 100221101212201021 |
4 | 20200020102301 |
5 | 243003442210 |
6 | 22053135441 |
7 | 3351264643 |
oct | 1040102261 |
9 | 327355637 |
10 | 142640305 |
11 | 73575855 |
12 | 3b92a581 |
13 | 23723062 |
14 | 14d30893 |
15 | c7c8bda |
hex | 88084b1 |
142640305 has 8 divisors (see below), whose sum is σ = 171678312. Its totient is φ = 113772288.
The previous prime is 142640287. The next prime is 142640327. The reversal of 142640305 is 503046241.
It can be written as a sum of positive squares in 4 ways, for example, as 935089 + 141705216 = 967^2 + 11904^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142640305 - 219 = 142116017 is a prime.
It is a super-2 number, since 2×1426403052 = 40692513220986050, which contains 22 as substring.
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 142640305.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40642 + ... + 44011.
It is an arithmetic number, because the mean of its divisors is an integer number (21459789).
Almost surely, 2142640305 is an apocalyptic number.
It is an amenable number.
142640305 is a deficient number, since it is larger than the sum of its proper divisors (29038007).
142640305 is an equidigital number, since it uses as much as digits as its factorization.
142640305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84995.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 142640305 is about 11943.2116702334. The cubic root of 142640305 is about 522.4933326378.
Adding to 142640305 its reverse (503046241), we get a palindrome (645686546).
The spelling of 142640305 in words is "one hundred forty-two million, six hundred forty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •