Base | Representation |
---|---|
bin | 10001111001010… |
… | …00100110001101 |
3 | 101110110111211220 |
4 | 20330220212031 |
5 | 301412101103 |
6 | 22521233553 |
7 | 3501636135 |
oct | 1074504615 |
9 | 343414756 |
10 | 150112653 |
11 | 77809949 |
12 | 423328b9 |
13 | 2513b272 |
14 | 15d17ac5 |
15 | d2a2c53 |
hex | 8f2898d |
150112653 has 4 divisors (see below), whose sum is σ = 200150208. Its totient is φ = 100075100.
The previous prime is 150112639. The next prime is 150112667. The reversal of 150112653 is 356211051.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (150112639) and next prime (150112667).
It is a cyclic number.
It is not a de Polignac number, because 150112653 - 214 = 150096269 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150112693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25018773 + ... + 25018778.
It is an arithmetic number, because the mean of its divisors is an integer number (50037552).
Almost surely, 2150112653 is an apocalyptic number.
It is an amenable number.
150112653 is a deficient number, since it is larger than the sum of its proper divisors (50037555).
150112653 is an equidigital number, since it uses as much as digits as its factorization.
150112653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50037554.
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 150112653 is about 12252.0468902139. The cubic root of 150112653 is about 531.4622642798.
The spelling of 150112653 in words is "one hundred fifty million, one hundred twelve thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •