Base | Representation |
---|---|
bin | 10001011011101… |
… | …10101101000000 |
3 | 101012011200012022 |
4 | 20231312231000 |
5 | 244414111042 |
6 | 22302221012 |
7 | 3424001435 |
oct | 1055665500 |
9 | 335150168 |
10 | 146238272 |
11 | 75602a84 |
12 | 40b84768 |
13 | 243b292b |
14 | 155c9b8c |
15 | cc89cd2 |
hex | 8b76b40 |
146238272 has 56 divisors (see below), whose sum is σ = 297841416. Its totient is φ = 71221248.
The previous prime is 146238263. The next prime is 146238277. The reversal of 146238272 is 272832641.
It can be written as a sum of positive squares in 4 ways, for example, as 891136 + 145347136 = 944^2 + 12056^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146238277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 527798 + ... + 528074.
Almost surely, 2146238272 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 146238272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148920708).
146238272 is an abundant number, since it is smaller than the sum of its proper divisors (151603144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146238272 is a wasteful number, since it uses less digits than its factorization.
146238272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475 (or 465 counting only the distinct ones).
The product of its digits is 32256, while the sum is 35.
The square root of 146238272 is about 12092.9017196039. The cubic root of 146238272 is about 526.8500378052.
The spelling of 146238272 in words is "one hundred forty-six million, two hundred thirty-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •