Base | Representation |
---|---|
bin | 1000101111101110100… |
… | …0001011110001010100 |
3 | 112100211012211101201210 |
4 | 2023323220023301110 |
5 | 4430203112101002 |
6 | 153005113421420 |
7 | 13566230130303 |
oct | 2137350136124 |
9 | 470735741653 |
10 | 150250503252 |
11 | 587a2545a33 |
12 | 2515270a870 |
13 | 11226439c35 |
14 | 73b4b5c43a |
15 | 3d95ab296c |
hex | 22fba0bc54 |
150250503252 has 24 divisors (see below), whose sum is σ = 350961912000. Its totient is φ = 50029586176.
The previous prime is 150250503209. The next prime is 150250503253. The reversal of 150250503252 is 252305052051.
150250503252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150250503253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6727752 + ... + 6750047.
It is an arithmetic number, because the mean of its divisors is an integer number (14623413000).
Almost surely, 2150250503252 is an apocalyptic number.
150250503252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150250503252 is an abundant number, since it is smaller than the sum of its proper divisors (200711408748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150250503252 is a wasteful number, since it uses less digits than its factorization.
150250503252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13478735 (or 13478733 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
The spelling of 150250503252 in words is "one hundred fifty billion, two hundred fifty million, five hundred three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •