Recognised as Number
1,339,108
- Positive
- Even
- Composite
- 7 digits
1,339,108 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,339,108
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 334,777
Distinct prime factors22, 334,777
Number of divisors6
Sum of divisors σ(n)2,343,446
Aliquot sum1,004,338sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)669,552integers below n that share no factor with it
Carmichael function λ(n)334,776the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 669,552
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 334,777, 669,554, 1,339,1086 in total
Arithmetic
Previous number1,339,107
Next number1,339,109
Double2,678,216
Half669,554
Square1,793,210,235,664
Cube2,401,302,172,259,547,712
Square root1,157.198340821≈irrational, shown to 9 decimal places
Cube root110.222908864≈
Negation-1,339,108
Reciprocal7.46765758 × 10^-7≈
Representations
Decimal1,339,108
Binary10100011011101110010021 bits
Octal5067344
Hexadecimal146EE4
Base 36SP9G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-nine thousand, one hundred and eight
Ordinalone million, three hundred and thirty-nine thousand, one hundred and eighth
Scientific notation1.339108 × 10^6
Engineering notation1.339108 × 10^6
In other bases
Ternary2112000220121base 3; the most digit-efficient integer base after e: 13 digits
Quinary320322413base 5; one hand: 9 digits
Septenary14245051base 7: 8 digits
Nonary2460817base 9; each digit is two ternary digits: 7 digits
Duodecimal546b44base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal877f8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:11:58:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT0010T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011011001100100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000110111011100100
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes314 6e e4
Gray code111100101100110010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000110111011100100
64-bit0000000000000000000000000000000000000000000101000110111011100100
One's complement11111111111010111001000100011011at 32 bits, every bit flipped
Bits reversed00100111011101100010100000000000at 32 bits
Rotated left by 100000000001010001101110111001000at 32 bits, wrapping
Shifted left by 11010001101110111001000= 2,678,216, no wrap
Shifted right by 110100011011101110010= 669,554, discarding the low bit
These bits as a double6.61607259 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,339,108 to the power 21,793,210,235,664
1,339,108 to the power 32,401,302,172,259,547,712
1,339,108 to the power 43,215,602,949,290,138,417,520,896
1,339,108 to the power 54,306,039,634,218,018,676,009,572,000,768
First ten multiples1,339,108, 2,678,216, 4,017,324, 5,356,432, 6,695,540, 8,034,648, 9,373,756, 10,712,864, 12,051,972, 13,391,080
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 8
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached1,339,108
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,339,108 → 669,554 → 334,777 → 1,004,332 → 502,166 → 251,083 → 753,250 → 376,625 → 1,129,876 → 564,938 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,910,800%
1,339,108% as a decimal13,391.08
1,339,108% of 1001,339,108
1,339,108% of 1,00013,391,080
As a fraction of 1001,339,108/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 1,339,108
Nerdulate something else
Nothing in mind? Surprise me · today’s page