Base | Representation |
---|---|
bin | 10001111011100… |
… | …10111110100000 |
3 | 101111000222202120 |
4 | 20331302332200 |
5 | 302001323222 |
6 | 22531544240 |
7 | 3504345303 |
oct | 1075627640 |
9 | 344028676 |
10 | 150417312 |
11 | 779a7831 |
12 | 4245b080 |
13 | 25216b36 |
14 | 15d96b3a |
15 | d31315c |
hex | 8f72fa0 |
150417312 has 24 divisors (see below), whose sum is σ = 394845696. Its totient is φ = 50139072.
The previous prime is 150417307. The next prime is 150417313. The reversal of 150417312 is 213714051.
150417312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (150417313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 783328 + ... + 783519.
It is an arithmetic number, because the mean of its divisors is an integer number (16451904).
Almost surely, 2150417312 is an apocalyptic number.
150417312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150417312 is an abundant number, since it is smaller than the sum of its proper divisors (244428384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150417312 is a wasteful number, since it uses less digits than its factorization.
150417312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566860 (or 1566852 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 150417312 is about 12264.4735720699. The cubic root of 150417312 is about 531.8215618802.
The spelling of 150417312 in words is "one hundred fifty million, four hundred seventeen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •