Base | Representation |
---|---|
bin | 10001011011110… |
… | …01100110010100 |
3 | 101012012021110120 |
4 | 20231321212110 |
5 | 244420001012 |
6 | 22302351540 |
7 | 3424051140 |
oct | 1055714624 |
9 | 335167416 |
10 | 146250132 |
11 | 75610986 |
12 | 40b8b5b0 |
13 | 243b8152 |
14 | 155d0220 |
15 | cc8d58c |
hex | 8b79994 |
146250132 has 48 divisors (see below), whose sum is σ = 403455360. Its totient is φ = 40344192.
The previous prime is 146250119. The next prime is 146250149. The reversal of 146250132 is 231052641.
146250132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1462501322 = 42778202220034848, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27583 + ... + 32454.
It is an arithmetic number, because the mean of its divisors is an integer number (8405320).
Almost surely, 2146250132 is an apocalyptic number.
146250132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146250132 is an abundant number, since it is smaller than the sum of its proper divisors (257205228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146250132 is a wasteful number, since it uses less digits than its factorization.
146250132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60080 (or 60078 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 146250132 is about 12093.3920799749. The cubic root of 146250132 is about 526.8642800243.
It can be divided in two parts, 146 and 250132, that added together give a triangular number (250278 = T707).
The spelling of 146250132 in words is "one hundred forty-six million, two hundred fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •