Base | Representation |
---|---|
bin | 10010000111010… |
… | …11011001101110 |
3 | 101120221022202200 |
4 | 21003223121232 |
5 | 302400143100 |
6 | 23025002330 |
7 | 3523426410 |
oct | 1103533156 |
9 | 346838680 |
10 | 151959150 |
11 | 78860182 |
12 | 42a833a6 |
13 | 25636875 |
14 | 162789b0 |
15 | d519e00 |
hex | 90eb66e |
151959150 has 144 divisors (see below), whose sum is σ = 491337600. Its totient is φ = 32892480.
The previous prime is 151959077. The next prime is 151959151. The reversal of 151959150 is 51959151.
151959150 is a `hidden beast` number, since 1 + 5 + 19 + 591 + 50 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151959151) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 58581 + ... + 61119.
Almost surely, 2151959150 is an apocalyptic number.
151959150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 151959150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (245668800).
151959150 is an abundant number, since it is smaller than the sum of its proper divisors (339378450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151959150 is a wasteful number, since it uses less digits than its factorization.
151959150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2583 (or 2575 counting only the distinct ones).
The product of its (nonzero) digits is 10125, while the sum is 36.
The square root of 151959150 is about 12327.1712083511. The cubic root of 151959150 is about 533.6325165980.
Subtracting from 151959150 its reverse (51959151), we obtain a palindrome (99999999).
The spelling of 151959150 in words is "one hundred fifty-one million, nine hundred fifty-nine thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •