Base | Representation |
---|---|
bin | 1000110010101101001… |
… | …1000011100110010001 |
3 | 112102212221201210222222 |
4 | 2030223103003212101 |
5 | 4433322332133441 |
6 | 153220323310425 |
7 | 13625111056121 |
oct | 2145323034621 |
9 | 472787653888 |
10 | 151050271121 |
11 | 59072a38412 |
12 | 2533651b415 |
13 | 1132303b269 |
14 | 744d066c81 |
15 | 3de0de0d4b |
hex | 232b4c3991 |
151050271121 has 8 divisors (see below), whose sum is σ = 155927328000. Its totient is φ = 146173493520.
The previous prime is 151050271087. The next prime is 151050271199. The reversal of 151050271121 is 121172050151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151050271121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151050271721) 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, 2126030 + ... + 2195928.
It is an arithmetic number, because the mean of its divisors is an integer number (19490916000).
Almost surely, 2151050271121 is an apocalyptic number.
It is an amenable number.
151050271121 is a deficient number, since it is larger than the sum of its proper divisors (4877056879).
151050271121 is an equidigital number, since it uses as much as digits as its factorization.
151050271121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139639.
The product of its (nonzero) digits is 700, while the sum is 26.
The spelling of 151050271121 in words is "one hundred fifty-one billion, fifty million, two hundred seventy-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •