Base | Representation |
---|---|
bin | 100010001000101100101010… |
… | …110111100110110010100011 |
3 | 201200120102010111120022021000 |
4 | 202020230222313212302203 |
5 | 124134222401032122210 |
6 | 1251145211221203043 |
7 | 43423425411241065 |
oct | 4210545267466243 |
9 | 650512114508230 |
10 | 150131301051555 |
11 | 4392236658a70a |
12 | 14a08550b60483 |
13 | 65a0423156225 |
14 | 29105725db735 |
15 | 12553d65deac0 |
hex | 888b2ade6ca3 |
150131301051555 has 16 divisors (see below), whose sum is σ = 266900090758560. Its totient is φ = 80070027227424.
The previous prime is 150131301051491. The next prime is 150131301051587. The reversal of 150131301051555 is 555150103131051.
150131301051555 is a `hidden beast` number, since 1 + 5 + 0 + 1 + 3 + 130 + 1 + 0 + 515 + 5 + 5 = 666.
It is not a de Polignac number, because 150131301051555 - 26 = 150131301051491 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 556041855612 + ... + 556041855881.
It is an arithmetic number, because the mean of its divisors is an integer number (16681255672410).
Almost surely, 2150131301051555 is an apocalyptic number.
150131301051555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
150131301051555 is a deficient number, since it is larger than the sum of its proper divisors (116768789707005).
150131301051555 is a wasteful number, since it uses less digits than its factorization.
150131301051555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112083711507 (or 1112083711501 counting only the distinct ones).
The product of its (nonzero) digits is 28125, while the sum is 36.
The spelling of 150131301051555 in words is "one hundred fifty trillion, one hundred thirty-one billion, three hundred one million, fifty-one thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •