Recognised as Number
3,096,139
- Positive
- Odd
- Composite
- 7 digits
3,096,139 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,096,139
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation317 × 9,767
Distinct prime factors2317, 9,767
Number of divisors4
Sum of divisors σ(n)3,106,224
Aliquot sum10,085sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,086,056integers below n that share no factor with it
Carmichael function λ(n)1,543,028the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,086,056
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 317, 9,767, 3,096,1394 in total
Arithmetic
Previous number3,096,138
Next number3,096,140
Double6,192,278
Half1,548,069.5
Square9,586,076,707,321
Cube29,679,825,950,528,133,619
Square root1,759.584894229≈irrational, shown to 9 decimal places
Cube root145.749413777≈
Negation-3,096,139
Reciprocal3.22982915 × 10^-7≈
Representations
Decimal3,096,139
Binary101111001111100100101122 bits
Octal13637113
Hexadecimal2F3E4B
Base 361UCZV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, ninety-six thousand, one hundred and thirty-nine
Ordinalthree million, ninety-six thousand, one hundred and thirty-ninth
Scientific notation3.096139 × 10^6
Engineering notation3.096139 × 10^6
In other bases
Ternary12211022002211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1243034024base 5; one hand: 10 digits
Septenary35213434base 7: 8 digits
Nonary5738084base 9; each digit is two ternary digits: 7 digits
Duodecimal10538b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj706jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:20:2:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1110T010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110100001001011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011110011111001001011
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes32f 3e 4b
Gray code1110001010000101101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011110011111001001011
64-bit0000000000000000000000000000000000000000001011110011111001001011
One's complement11111111110100001100000110110100at 32 bits, every bit flipped
Bits reversed11010010011111001111010000000000at 32 bits
Rotated left by 100000000010111100111110010010110at 32 bits, wrapping
Shifted left by 110111100111110010010110= 6,192,278, no wrap
Shifted right by 1101111001111100100101= 1,548,069, discarding the low bit
These bits as a double1.52969591 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,096,139 to the power 29,586,076,707,321
3,096,139 to the power 329,679,825,950,528,133,619
3,096,139 to the power 491,892,866,638,642,225,094,997,041
3,096,139 to the power 5284,513,088,221,699,100,163,399,043,524,699
First ten multiples3,096,139, 6,192,278, 9,288,417, 12,384,556, 15,480,695, 18,576,834, 21,672,973, 24,769,112, 27,865,251, 30,961,390
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1195the total stopping time
Highest value reached13,932,6284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,096,139 → 9,288,418 → 4,644,209 → 13,932,628 → 6,966,314 → 3,483,157 → 10,449,472 → 5,224,736 → 2,612,368 → 1,306,184 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage309,613,900%
3,096,139% as a decimal30,961.39
3,096,139% of 1003,096,139
3,096,139% of 1,00030,961,390
As a fraction of 1003,096,139/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,096,139
Nerdulate something else
Nothing in mind? Surprise me · today’s page