Base | Representation |
---|---|
bin | 10001111100101… |
… | …00001011100001 |
3 | 101111021220022122 |
4 | 20332110023201 |
5 | 302020201223 |
6 | 22534514025 |
7 | 3505452641 |
oct | 1076241341 |
9 | 344256278 |
10 | 150553313 |
11 | 77a8aa29 |
12 | 42505915 |
13 | 25263a01 |
14 | 15dd0521 |
15 | d33d5c8 |
hex | 8f942e1 |
150553313 has 4 divisors (see below), whose sum is σ = 151034628. Its totient is φ = 150072000.
The previous prime is 150553303. The next prime is 150553357. The reversal of 150553313 is 313355051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 313355051 = 239 ⋅1311109.
It can be written as a sum of positive squares in 2 ways, for example, as 47997184 + 102556129 = 6928^2 + 10127^2 .
It is a cyclic number.
It is not a de Polignac number, because 150553313 - 28 = 150553057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150553303) 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, 240188 + ... + 240813.
It is an arithmetic number, because the mean of its divisors is an integer number (37758657).
Almost surely, 2150553313 is an apocalyptic number.
It is an amenable number.
150553313 is a deficient number, since it is larger than the sum of its proper divisors (481315).
150553313 is an equidigital number, since it uses as much as digits as its factorization.
150553313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481314.
The product of its (nonzero) digits is 3375, while the sum is 26.
The square root of 150553313 is about 12270.0168296543. The cubic root of 150553313 is about 531.9817971517.
The spelling of 150553313 in words is "one hundred fifty million, five hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •