Base | Representation |
---|---|
bin | 10001111001010… |
… | …01010000000011 |
3 | 101110110122112002 |
4 | 20330221100003 |
5 | 301412142311 |
6 | 22521254215 |
7 | 3501650012 |
oct | 1074512003 |
9 | 343418462 |
10 | 150115331 |
11 | 77810963 |
12 | 4233436b |
13 | 2513c552 |
14 | 15d18a79 |
15 | d2a393b |
hex | 8f29403 |
150115331 has 4 divisors (see below), whose sum is σ = 150197352. Its totient is φ = 150033312.
The previous prime is 150115267. The next prime is 150115337. The reversal of 150115331 is 133511051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133511051 = 1823 ⋅73237.
It is a cyclic number.
It is not a de Polignac number, because 150115331 - 26 = 150115267 is a prime.
It is a super-2 number, since 2×1501153312 = 45069225202479122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150115337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38201 + ... + 41946.
It is an arithmetic number, because the mean of its divisors is an integer number (37549338).
Almost surely, 2150115331 is an apocalyptic number.
150115331 is a deficient number, since it is larger than the sum of its proper divisors (82021).
150115331 is an equidigital number, since it uses as much as digits as its factorization.
150115331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82020.
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 150115331 is about 12252.1561775877. The cubic root of 150115331 is about 531.4654246785.
Adding to 150115331 its reverse (133511051), we get a palindrome (283626382).
The spelling of 150115331 in words is "one hundred fifty million, one hundred fifteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •