Base | Representation |
---|---|
bin | 1000101111111110011… |
… | …1001110111111000000 |
3 | 112100222212122020020210 |
4 | 2023333213032333000 |
5 | 4430322221110021 |
6 | 153015502434120 |
7 | 13601001335133 |
oct | 2137747167700 |
9 | 470885566223 |
10 | 150317363136 |
11 | 58827261836 |
12 | 25170b92940 |
13 | 112372493b5 |
14 | 73bd9a421a |
15 | 3d9b8bce76 |
hex | 22ff9cefc0 |
150317363136 has 56 divisors (see below), whose sum is σ = 397743653584. Its totient is φ = 50102138880.
The previous prime is 150317363123. The next prime is 150317363137. The reversal of 150317363136 is 631363713051.
It is a junction number, because it is equal to n+sod(n) for n = 150317363094 and 150317363103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150317363137) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4409196 + ... + 4443156.
Almost surely, 2150317363136 is an apocalyptic number.
150317363136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
150317363136 is an abundant number, since it is smaller than the sum of its proper divisors (247426290448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150317363136 is a wasteful number, since it uses less digits than its factorization.
150317363136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57029 (or 57019 counting only the distinct ones).
The product of its (nonzero) digits is 102060, while the sum is 39.
The spelling of 150317363136 in words is "one hundred fifty billion, three hundred seventeen million, three hundred sixty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •