Recognised as Number
1,132,732
- Positive
- Even
- Composite
- 7 digits
1,132,732 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,132,732
Digit count7
Digit sum19
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 283,183
Distinct prime factors22, 283,183
Number of divisors6
Sum of divisors σ(n)1,982,288
Aliquot sum849,556sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)566,364integers below n that share no factor with it
Carmichael function λ(n)283,182the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 566,364
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 283,183, 566,366, 1,132,7326 in total
Arithmetic
Previous number1,132,731
Next number1,132,733
Double2,265,464
Half566,366
Square1,283,081,783,824
Cube1,453,387,795,154,527,168
Square root1,064.298830216≈irrational, shown to 9 decimal places
Cube root104.24191711≈
Negation-1,132,732
Reciprocal8.82821356 × 10^-7≈
Representations
Decimal1,132,732
Binary10001010010001011110021 bits
Octal4244274
Hexadecimal1148BC
Base 36OA0S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-two thousand, seven hundred and thirty-two
Ordinalone million, one hundred and thirty-two thousand, seven hundred and thirty-second
Scientific notation1.132732 × 10^6
Engineering notation1.132732 × 10^6
In other bases
Ternary2010112211001base 3; the most digit-efficient integer base after e: 13 digits
Quinary242221412base 5; one hand: 9 digits
Septenary12425266base 7: 8 digits
Nonary2115731base 9; each digit is two ternary digits: 7 digits
Duodecimal467624base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71bgcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:38:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011TT0T11001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010101100111001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010100100010111100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes311 48 bc
Gray code110011110110011100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010100100010111100
64-bit0000000000000000000000000000000000000000000100010100100010111100
One's complement11111111111011101011011101000011at 32 bits, every bit flipped
Bits reversed00111101000100101000100000000000at 32 bits
Rotated left by 100000000001000101001000101111000at 32 bits, wrapping
Shifted left by 11000101001000101111000= 2,265,464, no wrap
Shifted right by 110001010010001011110= 566,366, discarding the low bit
These bits as a double5.59643967 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,132,732 to the power 21,283,081,783,824
1,132,732 to the power 31,453,387,795,154,527,168
1,132,732 to the power 41,646,298,863,980,977,868,062,976
1,132,732 to the power 51,864,815,404,794,901,022,446,710,930,432
First ten multiples1,132,732, 2,265,464, 3,398,196, 4,530,928, 5,663,660, 6,796,392, 7,929,124, 9,061,856, 10,194,588, 11,327,320
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 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached3,628,8523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,132,732 → 566,366 → 283,183 → 849,550 → 424,775 → 1,274,326 → 637,163 → 1,911,490 → 955,745 → 2,867,236 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,273,200%
1,132,732% as a decimal11,327.32
1,132,732% of 1001,132,732
1,132,732% of 1,00011,327,320
As a fraction of 1001,132,732/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,132,732
Nerdulate something else
Nothing in mind? Surprise me · today’s page