Base | Representation |
---|---|
bin | 10001111101110… |
… | …01000010101100 |
3 | 101111120120102202 |
4 | 20332321002230 |
5 | 302040014200 |
6 | 22542041032 |
7 | 3506652065 |
oct | 1076710254 |
9 | 344516382 |
10 | 150704300 |
11 | 7808340a |
12 | 42579178 |
13 | 252b7656 |
14 | 1602d56c |
15 | d36d1d5 |
hex | 8fb90ac |
150704300 has 72 divisors (see below), whose sum is σ = 341488560. Its totient is φ = 57657600.
The previous prime is 150704297. The next prime is 150704321. The reversal of 150704300 is 3407051.
It is a happy number.
150704300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 455135 + ... + 455465.
Almost surely, 2150704300 is an apocalyptic number.
150704300 is a gapful number since it is divisible by the number (10) 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 150704300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170744280).
150704300 is an abundant number, since it is smaller than the sum of its proper divisors (190784260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150704300 is a wasteful number, since it uses less digits than its factorization.
150704300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531 (or 524 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 20.
The square root of 150704300 is about 12276.1679688737. The cubic root of 150704300 is about 532.1595758130.
The spelling of 150704300 in words is "one hundred fifty million, seven hundred four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •