Base | Representation |
---|---|
bin | 1000101111010100001… |
… | …1100111001111010101 |
3 | 112100112112101010000100 |
4 | 2023311003213033111 |
5 | 4424441401100031 |
6 | 152550134404313 |
7 | 13563421044354 |
oct | 2136503471725 |
9 | 470475333010 |
10 | 150140253141 |
11 | 5874629343a |
12 | 25121800699 |
13 | 11209647a98 |
14 | 73a425d99b |
15 | 3d8b085de6 |
hex | 22f50e73d5 |
150140253141 has 12 divisors (see below), whose sum is σ = 218067429580. Its totient is φ = 99540498240.
The previous prime is 150140253121. The next prime is 150140253173. The reversal of 150140253141 is 141352041051.
150140253141 is a `hidden beast` number, since 1 + 50 + 1 + 40 + 2 + 531 + 41 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9627730641 + 140512522500 = 98121^2 + 374850^2 .
It is not a de Polignac number, because 150140253141 - 213 = 150140244949 is a prime.
It is a super-2 number, since 2×1501402531412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150140253121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46081936 + ... + 46085193.
Almost surely, 2150140253141 is an apocalyptic number.
It is an amenable number.
150140253141 is a deficient number, since it is larger than the sum of its proper divisors (67927176439).
150140253141 is a wasteful number, since it uses less digits than its factorization.
150140253141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92167316 (or 92167313 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 150140253141 its reverse (141352041051), we get a palindrome (291492294192).
The spelling of 150140253141 in words is "one hundred fifty billion, one hundred forty million, two hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •