Base | Representation |
---|---|
bin | 10001000000010… |
… | …01101001101101 |
3 | 100221102011100100 |
4 | 20200021221231 |
5 | 243004131434 |
6 | 22053221313 |
7 | 3351320112 |
oct | 1040115155 |
9 | 327364310 |
10 | 142645869 |
11 | 73579a53 |
12 | 3b931839 |
13 | 23725752 |
14 | 14d32909 |
15 | c7ca699 |
hex | 8809a6d |
142645869 has 12 divisors (see below), whose sum is σ = 208867516. Its totient is φ = 93794112.
The previous prime is 142645829. The next prime is 142645871. The reversal of 142645869 is 968546241.
142645869 is a `hidden beast` number, since 1 + 4 + 2 + 64 + 586 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 47817225 + 94828644 = 6915^2 + 9738^2 .
It is not a de Polignac number, because 142645869 - 212 = 142641773 is a prime.
It is a super-2 number, since 2×1426458692 = 40695687885530322, 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 (142645819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 107902 + ... + 109215.
Almost surely, 2142645869 is an apocalyptic number.
It is an amenable number.
142645869 is a deficient number, since it is larger than the sum of its proper divisors (66221647).
142645869 is a wasteful number, since it uses less digits than its factorization.
142645869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217196 (or 217193 counting only the distinct ones).
The product of its digits is 414720, while the sum is 45.
The square root of 142645869 is about 11943.4446036309. Note that the first 3 decimals coincide. The cubic root of 142645869 is about 522.5001262181.
The spelling of 142645869 in words is "one hundred forty-two million, six hundred forty-five thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •