Recognised as Number
1,289,329
- Positive
- Odd
- Prime
- 7 digits
1,289,329 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,289,329
Digit count7
Digit sum34
Digit product7,776
Multiplicative persistence3times 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 factorisation1,289,329
Distinct prime factors11,289,329
Number of divisors2
Sum of divisors σ(n)1,289,330
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,289,328integers below n that share no factor with it
Carmichael function λ(n)1,289,328the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,289,3292 in total
Arithmetic
Previous number1,289,328
Next number1,289,330
Double2,578,658
Half644,664.5
Square1,662,369,270,241
Cube2,143,340,908,830,558,289
Square root1,135.486239459≈irrational, shown to 9 decimal places
Cube root108.839845601≈
Negation-1,289,329
Reciprocal7.75597229 × 10^-7≈
Representations
Decimal1,289,329
Binary10011101011000111000121 bits
Octal4726161
Hexadecimal13AC71
Base 36RMUP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and eighty-nine thousand, three hundred and twenty-nine
Ordinalone million, two hundred and eighty-nine thousand, three hundred and twenty-ninth
Scientific notation1.289329 × 10^6
Engineering notation1.289329 × 10^6
In other bases
Ternary2102111121221base 3; the most digit-efficient integer base after e: 13 digits
Quinary312224304base 5; one hand: 9 digits
Septenary13646656base 7: 8 digits
Nonary2374557base 9; each digit is two ternary digits: 7 digits
Duodecimal522181base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal81369base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:58:8:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T110TTTT0T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001111110110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100111010110001110001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes313 ac 71
Gray code110100111101001001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100111010110001110001
64-bit0000000000000000000000000000000000000000000100111010110001110001
One's complement11111111111011000101001110001110at 32 bits, every bit flipped
Bits reversed10001110001101011100100000000000at 32 bits
Rotated left by 100000000001001110101100011100010at 32 bits, wrapping
Shifted left by 11001110101100011100010= 2,578,658, no wrap
Shifted right by 110011101011000111000= 644,664, discarding the low bit
These bits as a double6.37013165 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,289,329 to the power 21,662,369,270,241
1,289,329 to the power 32,143,340,908,830,558,289
1,289,329 to the power 42,763,471,590,641,594,888,198,081
1,289,329 to the power 53,563,024,062,490,336,895,605,543,577,649
First ten multiples1,289,329, 2,578,658, 3,867,987, 5,157,316, 6,446,645, 7,735,974, 9,025,303, 10,314,632, 11,603,961, 12,893,290
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached3,867,9883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,289,329 → 3,867,988 → 1,933,994 → 966,997 → 2,900,992 → 1,450,496 → 725,248 → 362,624 → 181,312 → 90,656 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage128,932,900%
1,289,329% as a decimal12,893.29
1,289,329% of 1001,289,329
1,289,329% of 1,00012,893,290
As a fraction of 1001,289,329/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,289,329
Nerdulate something else
Nothing in mind? Surprise me · today’s page