Base | Representation |
---|---|
bin | 10010000000100… |
… | …10110100001001 |
3 | 101112021020211121 |
4 | 21000102310021 |
5 | 302133301014 |
6 | 22553555241 |
7 | 3513043114 |
oct | 1100226411 |
9 | 345236747 |
10 | 151072009 |
11 | 78304700 |
12 | 42715b21 |
13 | 253b5b2a |
14 | 160c757b |
15 | d3e2124 |
hex | 9012d09 |
151072009 has 6 divisors (see below), whose sum is σ = 166054490. Its totient is φ = 137338080.
The previous prime is 151071997. The next prime is 151072043. The reversal of 151072009 is 900270151.
It can be written as a sum of positive squares in only one way, i.e., 109662784 + 41409225 = 10472^2 + 6435^2 .
It is not a de Polignac number, because 151072009 - 227 = 16854281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151072079) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 624144 + ... + 624385.
Almost surely, 2151072009 is an apocalyptic number.
It is an amenable number.
151072009 is a deficient number, since it is larger than the sum of its proper divisors (14982481).
151072009 is a wasteful number, since it uses less digits than its factorization.
151072009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248551 (or 1248540 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 151072009 is about 12291.1353828684. The cubic root of 151072009 is about 532.5920362272.
The spelling of 151072009 in words is "one hundred fifty-one million, seventy-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •