Base | Representation |
---|---|
bin | 1000110000000100101… |
… | …1000101110110001111 |
3 | 112101001200220011022101 |
4 | 2030001023011312033 |
5 | 4430400421240421 |
6 | 153022235455531 |
7 | 13601440001632 |
oct | 2140113056617 |
9 | 471050804271 |
10 | 150343540111 |
11 | 588400109a6 |
12 | 251798b75a7 |
13 | 1123c7b322b |
14 | 73c3259c19 |
15 | 3d9dd3e191 |
hex | 23012c5d8f |
150343540111 has 8 divisors (see below), whose sum is σ = 158025330144. Its totient is φ = 142757176320.
The previous prime is 150343540103. The next prime is 150343540147. The reversal of 150343540111 is 111045343051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150343540111 - 23 = 150343540103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150343540111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150343540411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23853330 + ... + 23859631.
It is an arithmetic number, because the mean of its divisors is an integer number (19753166268).
Almost surely, 2150343540111 is an apocalyptic number.
150343540111 is a deficient number, since it is larger than the sum of its proper divisors (7681790033).
150343540111 is a wasteful number, since it uses less digits than its factorization.
150343540111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47713121.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 150343540111 its reverse (111045343051), we get a palindrome (261388883162).
The spelling of 150343540111 in words is "one hundred fifty billion, three hundred forty-three million, five hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •