Base | Representation |
---|---|
bin | 10001111010101… |
… | …00100100010000 |
3 | 101110210122220020 |
4 | 20331110210100 |
5 | 301433332002 |
6 | 22525143440 |
7 | 3503316201 |
oct | 1075244420 |
9 | 343718806 |
10 | 150292752 |
11 | 77922195 |
12 | 423bab80 |
13 | 251a222c |
14 | 15d635a8 |
15 | d2db2bc |
hex | 8f54910 |
150292752 has 20 divisors (see below), whose sum is σ = 388256400. Its totient is φ = 50097568.
The previous prime is 150292711. The next prime is 150292799. The reversal of 150292752 is 257292051.
It is a happy number.
150292752 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1502927522 = 45175822607467008, which contains 22 as substring.
It is an unprimeable number.
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, 1565502 + ... + 1565597.
It is an arithmetic number, because the mean of its divisors is an integer number (19412820).
Almost surely, 2150292752 is an apocalyptic number.
150292752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150292752 is an abundant number, since it is smaller than the sum of its proper divisors (237963648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150292752 is a wasteful number, since it uses less digits than its factorization.
150292752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3131110 (or 3131104 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 150292752 is about 12259.3944385520. The cubic root of 150292752 is about 531.6747215406.
The spelling of 150292752 in words is "one hundred fifty million, two hundred ninety-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •