Base | Representation |
---|---|
bin | 10001111010111… |
… | …01101000001101 |
3 | 101110212112210221 |
4 | 20331131220031 |
5 | 301441023434 |
6 | 22530031341 |
7 | 3503532334 |
oct | 1075355015 |
9 | 343775727 |
10 | 150329869 |
11 | 77948068 |
12 | 42418551 |
13 | 251b60b1 |
14 | 15d72d1b |
15 | d2e72b4 |
hex | 8f5da0d |
150329869 has 4 divisors (see below), whose sum is σ = 150396480. Its totient is φ = 150263260.
The previous prime is 150329813. The next prime is 150329873. The reversal of 150329869 is 968923051.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 968923051 = 53 ⋅18281567.
It is a cyclic number.
It is not a de Polignac number, because 150329869 - 27 = 150329741 is a prime.
It is a super-2 number, since 2×1503298692 = 45198139027114322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150329899) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29797 + ... + 34474.
It is an arithmetic number, because the mean of its divisors is an integer number (37599120).
Almost surely, 2150329869 is an apocalyptic number.
It is an amenable number.
150329869 is a deficient number, since it is larger than the sum of its proper divisors (66611).
150329869 is an equidigital number, since it uses as much as digits as its factorization.
150329869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66610.
The product of its (nonzero) digits is 116640, while the sum is 43.
The square root of 150329869 is about 12260.9081637536. The cubic root of 150329869 is about 531.7184862289.
The spelling of 150329869 in words is "one hundred fifty million, three hundred twenty-nine thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •