Base | Representation |
---|---|
bin | 100000101010111… |
… | …0100110000001011 |
3 | 2211101202202202122 |
4 | 1001111310300023 |
5 | 4221114141024 |
6 | 300440121455 |
7 | 36110613251 |
oct | 10125646013 |
9 | 2741682678 |
10 | 1096240139 |
11 | 512887495 |
12 | 26716628b |
13 | 146165507 |
14 | a58405d1 |
15 | 66391d5e |
hex | 41574c0b |
1096240139 has 4 divisors (see below), whose sum is σ = 1096431024. Its totient is φ = 1096049256.
The previous prime is 1096240129. The next prime is 1096240147. The reversal of 1096240139 is 9310426901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9310426901 = 70009 ⋅132989.
It is a cyclic number.
It is not a de Polignac number, because 1096240139 - 228 = 827804683 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1096240099 and 1096240108.
It is not an unprimeable number, because it can be changed into a prime (1096240129) 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, 86552 + ... + 98405.
It is an arithmetic number, because the mean of its divisors is an integer number (274107756).
Almost surely, 21096240139 is an apocalyptic number.
1096240139 is a deficient number, since it is larger than the sum of its proper divisors (190885).
1096240139 is an equidigital number, since it uses as much as digits as its factorization.
1096240139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190884.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 1096240139 is about 33109.5173477355. The cubic root of 1096240139 is about 1031.1026426534.
The spelling of 1096240139 in words is "one billion, ninety-six million, two hundred forty thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •