Recognised as Number
1,332,312
- Positive
- Even
- Composite
- 7 digits
1,332,312 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,332,312
Digit count7
Digit sum15
Digit product108
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 43 × 1,291
Distinct prime factors42, 3, 43, 1,291
Number of divisors32
Sum of divisors σ(n)3,410,880
Aliquot sum2,078,568sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)433,440integers below n that share no factor with it
Carmichael function λ(n)9,030the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 433,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 24, 43, 86, 129, 172, 258, 344, 516, 1,032, 1,291, 2,582, 3,873, 5,164, 7,746, 10,328, 15,492, 30,984, 55,513, 111,026, 166,539, 222,052, 333,078, 444,104, 666,156, 1,332,31232 in total
Arithmetic
Previous number1,332,311
Next number1,332,313
Double2,664,624
Half666,156
Square1,775,055,265,344
Cube2,364,927,430,680,995,328
Square root1,154.25820335≈irrational, shown to 9 decimal places
Cube root110.036131381≈
Negation-1,332,312
Reciprocal7.5057494 × 10^-7≈
Representations
Decimal1,332,312
Binary10100010101000101100021 bits
Octal5052130
Hexadecimal145458
Base 36SK0O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-two thousand, three hundred and twelve
Ordinalone million, three hundred and thirty-two thousand, three hundred and twelfth
Scientific notation1.332312 × 10^6
Engineering notation1.332312 × 10^6
In other bases
Ternary2111200120220base 3; the most digit-efficient integer base after e: 13 digits
Quinary320113222base 5; one hand: 9 digits
Septenary14216202base 7: 8 digits
Nonary2450526base 9; each digit is two ternary digits: 7 digits
Duodecimal543020base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86afcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:10:5:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT01TT10T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101010110101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101010001011000
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes314 54 58
Gray code111100111111001110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101010001011000
64-bit0000000000000000000000000000000000000000000101000101010001011000
One's complement11111111111010111010101110100111at 32 bits, every bit flipped
Bits reversed00011010001010100010100000000000at 32 bits
Rotated left by 100000000001010001010100010110000at 32 bits, wrapping
Shifted left by 11010001010100010110000= 2,664,624, no wrap
Shifted right by 110100010101000101100= 666,156, discarding the low bit
These bits as a double6.58249589 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,332,312 to the power 21,775,055,265,344
1,332,312 to the power 32,364,927,430,680,995,328
1,332,312 to the power 43,150,821,195,025,458,247,438,336
1,332,312 to the power 54,197,876,887,986,758,328,561,064,312,832
First ten multiples1,332,312, 2,664,624, 3,996,936, 5,329,248, 6,661,560, 7,993,872, 9,326,184, 10,658,496, 11,990,808, 13,323,120
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached1,332,312
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,332,312 → 666,156 → 333,078 → 166,539 → 499,618 → 249,809 → 749,428 → 374,714 → 187,357 → 562,072 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,231,200%
1,332,312% as a decimal13,323.12
1,332,312% of 1001,332,312
1,332,312% of 1,00013,323,120
As a fraction of 1001,332,312/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,332,312
Nerdulate something else
Nothing in mind? Surprise me · today’s page