Recognised as Number
1,329,289
- Positive
- Odd
- Composite
- 7 digits
1,329,289 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,329,289
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 factorisation13 × 102,253
Distinct prime factors213, 102,253
Number of divisors4
Sum of divisors σ(n)1,431,556
Aliquot sum102,267sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,227,024integers below n that share no factor with it
Carmichael function λ(n)102,252the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,227,024
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 102,253, 1,329,2894 in total
Arithmetic
Previous number1,329,288
Next number1,329,290
Double2,658,578
Half664,644.5
Square1,767,009,245,521
Cube2,348,865,952,969,364,569
Square root1,152.947960664≈irrational, shown to 9 decimal places
Cube root109.952844802≈
Negation-1,329,289
Reciprocal7.52281859 × 10^-7≈
Representations
Decimal1,329,289
Binary10100010010001000100121 bits
Octal5044211
Hexadecimal144889
Base 36SHOP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty-nine thousand, two hundred and eighty-nine
Ordinalone million, three hundred and twenty-nine thousand, two hundred and eighty-ninth
Scientific notation1.329289 × 10^6
Engineering notation1.329289 × 10^6
In other bases
Ternary2111112102221base 3; the most digit-efficient integer base after e: 13 digits
Quinary320014124base 5; one hand: 9 digits
Septenary14204323base 7: 8 digits
Nonary2445387base 9; each digit is two ternary digits: 7 digits
Duodecimal541321base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86349base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:14:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTTTT1100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101100110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000100100010001001
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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
Bytes314 48 89
Gray code111100110110011001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000100100010001001
64-bit0000000000000000000000000000000000000000000101000100100010001001
One's complement11111111111010111011011101110110at 32 bits, every bit flipped
Bits reversed10010001000100100010100000000000at 32 bits
Rotated left by 100000000001010001001000100010010at 32 bits, wrapping
Shifted left by 11010001001000100010010= 2,658,578, no wrap
Shifted right by 110100010010001000100= 664,644, discarding the low bit
These bits as a double6.56756028 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,329,289 to the power 21,767,009,245,521
1,329,289 to the power 32,348,865,952,969,364,569
1,329,289 to the power 43,122,321,673,756,693,658,561,441
1,329,289 to the power 54,150,467,855,386,361,556,695,479,345,449
First ten multiples1,329,289, 2,658,578, 3,987,867, 5,317,156, 6,646,445, 7,975,734, 9,305,023, 10,634,312, 11,963,601, 13,292,890
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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1230the total stopping time
Highest value reached17,034,13612× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,329,289 → 3,987,868 → 1,993,934 → 996,967 → 2,990,902 → 1,495,451 → 4,486,354 → 2,243,177 → 6,729,532 → 3,364,766 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage132,928,900%
1,329,289% as a decimal13,292.89
1,329,289% of 1001,329,289
1,329,289% of 1,00013,292,890
As a fraction of 1001,329,289/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,329,289
Nerdulate something else
Nothing in mind? Surprise me · today’s page