Base | Representation |
---|---|
bin | 1101000000101… |
… | …01010011001111 |
3 | 21121100211202210 |
4 | 12200111103033 |
5 | 210414423101 |
6 | 14455121503 |
7 | 2463444642 |
oct | 640252317 |
9 | 247324683 |
10 | 109139151 |
11 | 56673950 |
12 | 30673293 |
13 | 197c35a4 |
14 | 106cda59 |
15 | 98ac7d6 |
hex | 68154cf |
109139151 has 16 divisors (see below), whose sum is σ = 164223360. Its totient is φ = 63863520.
The previous prime is 109139143. The next prime is 109139153. The reversal of 109139151 is 151931901.
It is not a de Polignac number, because 109139151 - 23 = 109139143 is a prime.
It is a super-2 number, since 2×1091391512 = 23822708562001602, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109139153) 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 15 ways as a sum of consecutive naturals, for example, 56065 + ... + 57978.
It is an arithmetic number, because the mean of its divisors is an integer number (10263960).
Almost surely, 2109139151 is an apocalyptic number.
109139151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
109139151 is a deficient number, since it is larger than the sum of its proper divisors (55084209).
109139151 is a wasteful number, since it uses less digits than its factorization.
109139151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114086.
The product of its (nonzero) digits is 1215, while the sum is 30.
The square root of 109139151 is about 10446.9685076581. The cubic root of 109139151 is about 477.8888051548. Note that the first 4 decimals are identical.
The spelling of 109139151 in words is "one hundred nine million, one hundred thirty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •