Base | Representation |
---|---|
bin | 100010001010100111010111… |
… | …100110010010011011000000 |
3 | 201201001000012011200011110000 |
4 | 202022213113212102123000 |
5 | 124143402210241121203 |
6 | 1251325520303240000 |
7 | 43436101256601240 |
oct | 4212472746223300 |
9 | 651030164604400 |
10 | 150263047988928 |
11 | 43973223270736 |
12 | 14a29b9a8a9000 |
13 | 65ac98ac2c6c4 |
14 | 2916aadac9b20 |
15 | 1258a479c94a3 |
hex | 88a9d79926c0 |
150263047988928 has 280 divisors, whose sum is σ = 519890191299072. Its totient is φ = 42018845769216.
The previous prime is 150263047988917. The next prime is 150263047988947. The reversal of 150263047988928 is 829889740362051.
150263047988928 is a `hidden beast` number, since 1 + 5 + 0 + 2 + 63 + 0 + 479 + 8 + 8 + 92 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 42346026 + ... + 45757097.
It is a 1-persistent number, because it is pandigital, but 2⋅150263047988928 = 300526095977856 is not.
Almost surely, 2150263047988928 is an apocalyptic number.
150263047988928 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
150263047988928 is an abundant number, since it is smaller than the sum of its proper divisors (369627143310144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150263047988928 is an equidigital number, since it uses as much as digits as its factorization.
150263047988928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88103201 (or 88103182 counting only the distinct ones).
The product of its (nonzero) digits is 418037760, while the sum is 72.
The spelling of 150263047988928 in words is "one hundred fifty trillion, two hundred sixty-three billion, forty-seven million, nine hundred eighty-eight thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •