Base | Representation |
---|---|
bin | 1000110000101010010… |
… | …1110001110111101001 |
3 | 112101110201011221012222 |
4 | 2030022211301313221 |
5 | 4431211342443423 |
6 | 153050042043425 |
7 | 13605365623043 |
oct | 2141245616751 |
9 | 471421157188 |
10 | 150501531113 |
11 | 5891121097a |
12 | 252027a9575 |
13 | 1126644c42b |
14 | 73da224a93 |
15 | 3dacb4b3c8 |
hex | 230a971de9 |
150501531113 has 12 divisors (see below), whose sum is σ = 161404286400. Its totient is φ = 140067200592.
The previous prime is 150501531107. The next prime is 150501531149. The reversal of 150501531113 is 311135105051.
150501531113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 150501531113 - 224 = 150484753897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150501531413) 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 11 ways as a sum of consecutive naturals, for example, 2358413 + ... + 2421386.
It is an arithmetic number, because the mean of its divisors is an integer number (13450357200).
Almost surely, 2150501531113 is an apocalyptic number.
It is an amenable number.
150501531113 is a deficient number, since it is larger than the sum of its proper divisors (10902755287).
150501531113 is an equidigital number, since it uses as much as digits as its factorization.
150501531113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4779896 (or 4779859 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 26.
Adding to 150501531113 its reverse (311135105051), we get a palindrome (461636636164).
The spelling of 150501531113 in words is "one hundred fifty billion, five hundred one million, five hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •