Recognised as Number
1,329,147
- Positive
- Odd
- Composite
- 7 digits
1,329,147 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,329,147
Digit count7
Digit sum27
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 23 × 6,421
Distinct prime factors33, 23, 6,421
Number of divisors12
Sum of divisors σ(n)2,003,664
Aliquot sum674,517sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)847,440integers below n that share no factor with it
Carmichael function λ(n)70,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 847,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 23, 69, 207, 6,421, 19,263, 57,789, 147,683, 443,049, 1,329,14712 in total
Arithmetic
Previous number1,329,146
Next number1,329,148
Double2,658,294
Half664,573.5
Square1,766,631,747,609
Cube2,348,113,287,439,259,523
Square root1,152.886377749≈irrational, shown to 9 decimal places
Cube root109.948929461≈
Negation-1,329,147
Reciprocal7.52362229 × 10^-7≈
Representations
Decimal1,329,147
Binary10100010001111111101121 bits
Octal5043773
Hexadecimal1447FB
Base 36SHKR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty-nine thousand, one hundred and forty-seven
Ordinalone million, three hundred and twenty-nine thousand, one hundred and forty-seventh
Scientific notation1.329147 × 10^6
Engineering notation1.329147 × 10^6
In other bases
Ternary2111112020200base 3; the most digit-efficient integer base after e: 13 digits
Quinary320013042base 5; one hand: 9 digits
Septenary14204031base 7: 8 digits
Nonary2445220base 9; each digit is two ternary digits: 7 digits
Duodecimal541223base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal862h7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:12:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTTTT1T1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101100000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000100011111111011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 47 fb
Gray code111100110010000000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000100011111111011
64-bit0000000000000000000000000000000000000000000101000100011111111011
One's complement11111111111010111011100000000100at 32 bits, every bit flipped
Bits reversed11011111111000100010100000000000at 32 bits
Rotated left by 100000000001010001000111111110110at 32 bits, wrapping
Shifted left by 11010001000111111110110= 2,658,294, no wrap
Shifted right by 110100010001111111101= 664,573, discarding the low bit
These bits as a double6.56685871 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,329,147 to the power 21,766,631,747,609
1,329,147 to the power 32,348,113,287,439,259,523
1,329,147 to the power 43,120,987,731,660,029,477,216,881
1,329,147 to the power 54,148,251,480,572,733,199,554,385,730,507
First ten multiples1,329,147, 2,658,294, 3,987,441, 5,316,588, 6,645,735, 7,974,882, 9,304,029, 10,633,176, 11,962,323, 13,291,470
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1253the total stopping time
Highest value reached64,669,58848× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,329,147 → 3,987,442 → 1,993,721 → 5,981,164 → 2,990,582 → 1,495,291 → 4,485,874 → 2,242,937 → 6,728,812 → 3,364,406 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage132,914,700%
1,329,147% as a decimal13,291.47
1,329,147% of 1001,329,147
1,329,147% of 1,00013,291,470
As a fraction of 1001,329,147/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,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page