Base | Representation |
---|---|
bin | 10010000001001… |
… | …10000101111100 |
3 | 101112102021011011 |
4 | 21000212011330 |
5 | 302143312342 |
6 | 22555405004 |
7 | 3513522250 |
oct | 1100460574 |
9 | 345367134 |
10 | 151150972 |
11 | 78358a65 |
12 | 42753764 |
13 | 25412a5b |
14 | 16108260 |
15 | d40a717 |
hex | 902617c |
151150972 has 12 divisors (see below), whose sum is σ = 302302000. Its totient is φ = 64778976.
The previous prime is 151150949. The next prime is 151150973. The reversal of 151150972 is 279051151.
151150972 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151150973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2699097 + ... + 2699152.
Almost surely, 2151150972 is an apocalyptic number.
It is an amenable number.
151150972 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151150972 is a wasteful number, since it uses less digits than its factorization.
151150972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5398260 (or 5398258 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 31.
The square root of 151150972 is about 12294.3471563154. The cubic root of 151150972 is about 532.6848126018.
The spelling of 151150972 in words is "one hundred fifty-one million, one hundred fifty thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •