Base | Representation |
---|---|
bin | 10001000000010… |
… | …00100101101101 |
3 | 100221101221101011 |
4 | 20200020211231 |
5 | 243004012032 |
6 | 22053145221 |
7 | 3351301324 |
oct | 1040104555 |
9 | 327357334 |
10 | 142641517 |
11 | 73576757 |
12 | 3b92b211 |
13 | 23723785 |
14 | 14d310bb |
15 | c7c9247 |
hex | 880896d |
142641517 has 4 divisors (see below), whose sum is σ = 147560220. Its totient is φ = 137722816.
The previous prime is 142641511. The next prime is 142641533. The reversal of 142641517 is 715146241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97831881 + 44809636 = 9891^2 + 6694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142641517 is a prime.
It is a super-2 number, since 2×1426415172 = 40693204744122578, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142641511) 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, 2459308 + ... + 2459365.
It is an arithmetic number, because the mean of its divisors is an integer number (36890055).
Almost surely, 2142641517 is an apocalyptic number.
It is an amenable number.
142641517 is a deficient number, since it is larger than the sum of its proper divisors (4918703).
142641517 is an equidigital number, since it uses as much as digits as its factorization.
142641517 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4918702.
The product of its digits is 6720, while the sum is 31.
The square root of 142641517 is about 11943.2624102462. The cubic root of 142641517 is about 522.4948124909.
Adding to 142641517 its reverse (715146241), we get a palindrome (857787758).
The spelling of 142641517 in words is "one hundred forty-two million, six hundred forty-one thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •