Base | Representation |
---|---|
bin | 1000101111101010100… |
… | …1111001011001000001 |
3 | 112100210002002211122020 |
4 | 2023322221321121001 |
5 | 4430134422100131 |
6 | 153003331432053 |
7 | 13565641263216 |
oct | 2137251713101 |
9 | 470702084566 |
10 | 150234175041 |
11 | 58794303345 |
12 | 25149155629 |
13 | 11222c40b82 |
14 | 73b290bb0d |
15 | 3d94439996 |
hex | 22faa79641 |
150234175041 has 8 divisors (see below), whose sum is σ = 206773918464. Its totient is φ = 96925274160.
The previous prime is 150234175037. The next prime is 150234175051. The reversal of 150234175041 is 140571432051.
150234175041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150234175041 - 22 = 150234175037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150234174993 and 150234175011.
It is not an unprimeable number, because it can be changed into a prime (150234175051) 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, 807710526 + ... + 807710711.
It is an arithmetic number, because the mean of its divisors is an integer number (25846739808).
Almost surely, 2150234175041 is an apocalyptic number.
It is an amenable number.
150234175041 is a deficient number, since it is larger than the sum of its proper divisors (56539743423).
150234175041 is a wasteful number, since it uses less digits than its factorization.
150234175041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615421271.
The product of its (nonzero) digits is 16800, while the sum is 33.
The spelling of 150234175041 in words is "one hundred fifty billion, two hundred thirty-four million, one hundred seventy-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •