Base | Representation |
---|---|
bin | 10010000010001… |
… | …10100110100100 |
3 | 101112200000211000 |
4 | 21001012212210 |
5 | 302212043012 |
6 | 23002313300 |
7 | 3514615416 |
oct | 1101064644 |
9 | 345600730 |
10 | 151284132 |
11 | 7843a00a |
12 | 427b8830 |
13 | 2545b54c |
14 | 161409b6 |
15 | d434ddc |
hex | 90469a4 |
151284132 has 48 divisors (see below), whose sum is σ = 393926400. Its totient is φ = 50208480.
The previous prime is 151284127. The next prime is 151284169. The reversal of 151284132 is 231482151.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 151284096 and 151284105.
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, 22882 + ... + 28742.
It is an arithmetic number, because the mean of its divisors is an integer number (8206800).
Almost surely, 2151284132 is an apocalyptic number.
151284132 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 151284132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196963200).
151284132 is an abundant number, since it is smaller than the sum of its proper divisors (242642268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151284132 is a wasteful number, since it uses less digits than its factorization.
151284132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6113 (or 6105 counting only the distinct ones).
The product of its digits is 1920, while the sum is 27.
The square root of 151284132 is about 12299.7614611016. The cubic root of 151284132 is about 532.8411937552.
The spelling of 151284132 in words is "one hundred fifty-one million, two hundred eighty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •