Base | Representation |
---|---|
bin | 10000111011110… |
… | …11111001100000 |
3 | 100220022122212212 |
4 | 20131323321200 |
5 | 242332041443 |
6 | 22032541252 |
7 | 3343351253 |
oct | 1035737140 |
9 | 326278785 |
10 | 142065248 |
11 | 732127a6 |
12 | 3b6b1828 |
13 | 235813a0 |
14 | 14c2109a |
15 | c713618 |
hex | 877be60 |
142065248 has 48 divisors (see below), whose sum is σ = 303690240. Its totient is φ = 65028096.
The previous prime is 142065241. The next prime is 142065257. The reversal of 142065248 is 842560241.
It is a super-3 number, since 3×1420652483 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142065241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51488 + ... + 54176.
It is an arithmetic number, because the mean of its divisors is an integer number (6326880).
Almost surely, 2142065248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142065248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151845120).
142065248 is an abundant number, since it is smaller than the sum of its proper divisors (161624992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142065248 is a wasteful number, since it uses less digits than its factorization.
142065248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2839 (or 2831 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 32.
The square root of 142065248 is about 11919.1127186549. The cubic root of 142065248 is about 521.7902398016.
The spelling of 142065248 in words is "one hundred forty-two million, sixty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •