Base | Representation |
---|---|
bin | 10010010111011… |
… | …00110100110100 |
3 | 101201220011111220 |
4 | 21023230310310 |
5 | 303414442012 |
6 | 23142030340 |
7 | 3550335510 |
oct | 1113546464 |
9 | 351804456 |
10 | 154062132 |
11 | 79a67184 |
12 | 437183b0 |
13 | 25bc1b33 |
14 | 16665140 |
15 | d7d308c |
hex | 92ecd34 |
154062132 has 48 divisors (see below), whose sum is σ = 413142912. Its totient is φ = 43770240.
The previous prime is 154062121. The next prime is 154062151. The reversal of 154062132 is 231260451.
154062132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 10138 + ... + 20270.
It is an arithmetic number, because the mean of its divisors is an integer number (8607144).
Almost surely, 2154062132 is an apocalyptic number.
154062132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 154062132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206571456).
154062132 is an abundant number, since it is smaller than the sum of its proper divisors (259080780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154062132 is a wasteful number, since it uses less digits than its factorization.
154062132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10328 (or 10326 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 154062132 is about 12412.1767631629. The cubic root of 154062132 is about 536.0829167411.
The spelling of 154062132 in words is "one hundred fifty-four million, sixty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •