Base | Representation |
---|---|
bin | 10001111010111… |
… | …10111110110101 |
3 | 101110212211102021 |
4 | 20331132332311 |
5 | 301441213123 |
6 | 22530113141 |
7 | 3503554444 |
oct | 1075367665 |
9 | 343784367 |
10 | 150335413 |
11 | 77951248 |
12 | 4241b7b1 |
13 | 251b8787 |
14 | 15d74d5b |
15 | d2e8c5d |
hex | 8f5efb5 |
150335413 has 4 divisors (see below), whose sum is σ = 150559468. Its totient is φ = 150111360.
The previous prime is 150335411. The next prime is 150335417. The reversal of 150335413 is 314533051.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65658609 + 84676804 = 8103^2 + 9202^2 .
It is a cyclic number.
It is not a de Polignac number, because 150335413 - 21 = 150335411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150335411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111018 + ... + 112363.
It is an arithmetic number, because the mean of its divisors is an integer number (37639867).
Almost surely, 2150335413 is an apocalyptic number.
It is an amenable number.
150335413 is a deficient number, since it is larger than the sum of its proper divisors (224055).
150335413 is an equidigital number, since it uses as much as digits as its factorization.
150335413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224054.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 150335413 is about 12261.1342460639. The cubic root of 150335413 is about 531.7250225459.
Adding to 150335413 its reverse (314533051), we get a palindrome (464868464).
The spelling of 150335413 in words is "one hundred fifty million, three hundred thirty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •