Base | Representation |
---|---|
bin | 10010000101011… |
… | …11000100001001 |
3 | 101120110202202022 |
4 | 21002233010021 |
5 | 302314241014 |
6 | 23015414225 |
7 | 3521350031 |
oct | 1102570411 |
9 | 346422668 |
10 | 151712009 |
11 | 78701529 |
12 | 42984375 |
13 | 2557b227 |
14 | 162128c1 |
15 | d4bba8e |
hex | 90af109 |
151712009 has 2 divisors, whose sum is σ = 151712010. Its totient is φ = 151712008.
The previous prime is 151711993. The next prime is 151712027. The reversal of 151712009 is 900217151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94633984 + 57078025 = 9728^2 + 7555^2 .
It is an emirp because it is prime and its reverse (900217151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151712009 - 24 = 151711993 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (151712609) 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 as a sum of consecutive naturals, namely, 75856004 + 75856005.
It is an arithmetic number, because the mean of its divisors is an integer number (75856005).
Almost surely, 2151712009 is an apocalyptic number.
It is an amenable number.
151712009 is a deficient number, since it is larger than the sum of its proper divisors (1).
151712009 is an equidigital number, since it uses as much as digits as its factorization.
151712009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 26.
The square root of 151712009 is about 12317.1428911091. The cubic root of 151712009 is about 533.3430659248.
The spelling of 151712009 in words is "one hundred fifty-one million, seven hundred twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •