Base | Representation |
---|---|
bin | 10001000000011… |
… | …10011101011000 |
3 | 100221110011100122 |
4 | 20200032131120 |
5 | 243010244220 |
6 | 22053452412 |
7 | 3351431402 |
oct | 1040163530 |
9 | 327404318 |
10 | 142665560 |
11 | 73592824 |
12 | 3b941108 |
13 | 237316bb |
14 | 14d39b72 |
15 | c7d1425 |
hex | 880e758 |
142665560 has 32 divisors (see below), whose sum is σ = 321429600. Its totient is φ = 56989440.
The previous prime is 142665541. The next prime is 142665571. The reversal of 142665560 is 65566241.
It is a super-2 number, since 2×1426655602 = 40706924020227200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 142665560.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 34820 + ... + 38700.
It is an arithmetic number, because the mean of its divisors is an integer number (10044675).
Almost surely, 2142665560 is an apocalyptic number.
142665560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142665560 is an abundant number, since it is smaller than the sum of its proper divisors (178764040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142665560 is a wasteful number, since it uses less digits than its factorization.
142665560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4811 (or 4807 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
The square root of 142665560 is about 11944.2689186069. The cubic root of 142665560 is about 522.5241672849.
The spelling of 142665560 in words is "one hundred forty-two million, six hundred sixty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •