Base | Representation |
---|---|
bin | 1000101111101100000… |
… | …0111011110010000110 |
3 | 112100210111110122201221 |
4 | 2023323000323302012 |
5 | 4430142443323100 |
6 | 153004105110554 |
7 | 13566043515025 |
oct | 2137300736206 |
9 | 470714418657 |
10 | 150240214150 |
11 | 58797758644 |
12 | 2514b18845a |
13 | 11224276900 |
14 | 73b36408bc |
15 | 3d94c2e01a |
hex | 22fb03bc86 |
150240214150 has 72 divisors (see below), whose sum is σ = 304775571240. Its totient is φ = 55073790720.
The previous prime is 150240214141. The next prime is 150240214171. The reversal of 150240214150 is 51412042051.
150240214150 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 (25).
It is a congruent number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 1110594 + ... + 1238506.
It is an arithmetic number, because the mean of its divisors is an integer number (4232994045).
Almost surely, 2150240214150 is an apocalyptic number.
150240214150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150240214150 is an abundant number, since it is smaller than the sum of its proper divisors (154535357090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150240214150 is a wasteful number, since it uses less digits than its factorization.
150240214150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128090 (or 128072 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 25.
The spelling of 150240214150 in words is "one hundred fifty billion, two hundred forty million, two hundred fourteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •