Base | Representation |
---|---|
bin | 10001111010011… |
… | …10001001011100 |
3 | 101110202022211110 |
4 | 20331032021130 |
5 | 301432011320 |
6 | 22524422020 |
7 | 3503146431 |
oct | 1075161134 |
9 | 343668743 |
10 | 150266460 |
11 | 77904463 |
12 | 423a7910 |
13 | 25193286 |
14 | 15d57b88 |
15 | d2d35e0 |
hex | 8f4e25c |
150266460 has 24 divisors (see below), whose sum is σ = 420746256. Its totient is φ = 40071040.
The previous prime is 150266447. The next prime is 150266489. The reversal of 150266460 is 64662051.
150266460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1252161 + ... + 1252280.
It is an arithmetic number, because the mean of its divisors is an integer number (17531094).
Almost surely, 2150266460 is an apocalyptic number.
150266460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150266460 is an abundant number, since it is smaller than the sum of its proper divisors (270479796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150266460 is a wasteful number, since it uses less digits than its factorization.
150266460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2504453 (or 2504451 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 150266460 is about 12258.3220711482. The cubic root of 150266460 is about 531.6437162596.
The spelling of 150266460 in words is "one hundred fifty million, two hundred sixty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •