Base | Representation |
---|---|
bin | 1000110000011111010… |
… | …1111111111000000101 |
3 | 112101100111110211101100 |
4 | 2030013311333320011 |
5 | 4431113043414031 |
6 | 153041314250313 |
7 | 13604266143102 |
oct | 2140765777005 |
9 | 471314424340 |
10 | 150455451141 |
11 | 588981a8356 |
12 | 251ab286999 |
13 | 11259a37388 |
14 | 73d406baa9 |
15 | 3da8a97de6 |
hex | 2307d7fe05 |
150455451141 has 24 divisors (see below), whose sum is σ = 221501961720. Its totient is φ = 98376909696.
The previous prime is 150455451061. The next prime is 150455451173. The reversal of 150455451141 is 141154554051.
150455451141 is a `hidden beast` number, since 1 + 50 + 4 + 5 + 54 + 511 + 41 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1220035041 + 149235416100 = 34929^2 + 386310^2 .
It is not a de Polignac number, because 150455451141 - 217 = 150455320069 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 150455451096 and 150455451105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150455451241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1357155 + ... + 1463823.
It is an arithmetic number, because the mean of its divisors is an integer number (9229248405).
Almost surely, 2150455451141 is an apocalyptic number.
It is an amenable number.
150455451141 is a deficient number, since it is larger than the sum of its proper divisors (71046510579).
150455451141 is a wasteful number, since it uses less digits than its factorization.
150455451141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109685 (or 109682 counting only the distinct ones).
The product of its (nonzero) digits is 40000, while the sum is 36.
The spelling of 150455451141 in words is "one hundred fifty billion, four hundred fifty-five million, four hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •