Base | Representation |
---|---|
bin | 10010000100101… |
… | …10011011100101 |
3 | 101120021122100021 |
4 | 21002112123211 |
5 | 302303023414 |
6 | 23013315141 |
7 | 3520446616 |
oct | 1102263345 |
9 | 346248307 |
10 | 151611109 |
11 | 78642741 |
12 | 42935ab1 |
13 | 25544320 |
14 | 161c7c0d |
15 | d49bc24 |
hex | 90966e5 |
151611109 has 4 divisors (see below), whose sum is σ = 163273516. Its totient is φ = 139948704.
The previous prime is 151611107. The next prime is 151611113. The reversal of 151611109 is 901116151.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 901116151 = 13 ⋅69316627.
It can be written as a sum of positive squares in 2 ways, for example, as 29398084 + 122213025 = 5422^2 + 11055^2 .
It is a cyclic number.
It is not a de Polignac number, because 151611109 - 21 = 151611107 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 (151611107) 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, 5831184 + ... + 5831209.
It is an arithmetic number, because the mean of its divisors is an integer number (40818379).
Almost surely, 2151611109 is an apocalyptic number.
It is an amenable number.
151611109 is a deficient number, since it is larger than the sum of its proper divisors (11662407).
151611109 is a wasteful number, since it uses less digits than its factorization.
151611109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11662406.
The product of its (nonzero) digits is 270, while the sum is 25.
The square root of 151611109 is about 12313.0462924493. The cubic root of 151611109 is about 533.2248018306.
The spelling of 151611109 in words is "one hundred fifty-one million, six hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •