Recognised as Number
1,132,004
- Positive
- Even
- Composite
- 7 digits
1,132,004 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,132,004
Digit count7
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 283,001
Distinct prime factors22, 283,001
Number of divisors6
Sum of divisors σ(n)1,981,014
Aliquot sum849,010sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)566,000integers below n that share no factor with it
Carmichael function λ(n)283,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 566,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 283,001, 566,002, 1,132,0046 in total
Arithmetic
Previous number1,132,003
Next number1,132,005
Double2,264,008
Half566,002
Square1,281,433,056,016
Cube1,450,587,345,142,336,064
Square root1,063.956766039≈irrational, shown to 9 decimal places
Cube root104.219580441≈
Negation-1,132,004
Reciprocal8.83389105 × 10^-7≈
Representations
Decimal1,132,004
Binary10001010001011110010021 bits
Octal4242744
Hexadecimal1145E4
Base 36O9GK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-two thousand and four
Ordinalone million, one hundred and thirty-two thousand and fourth
Scientific notation1.132004 × 10^6
Engineering notation1.132004 × 10^6
In other bases
Ternary2010111211002base 3; the most digit-efficient integer base after e: 13 digits
Quinary242211004base 5; one hand: 9 digits
Septenary12423206base 7: 8 digits
Nonary2114732base 9; each digit is two ternary digits: 7 digits
Duodecimal467118base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71a04base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:26:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011TTTT1101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010101101000100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010100010111100100
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 45 e4
Gray code110011110011100010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010100010111100100
64-bit0000000000000000000000000000000000000000000100010100010111100100
One's complement11111111111011101011101000011011at 32 bits, every bit flipped
Bits reversed00100111101000101000100000000000at 32 bits
Rotated left by 100000000001000101000101111001000at 32 bits, wrapping
Shifted left by 11000101000101111001000= 2,264,008, no wrap
Shifted right by 110001010001011110010= 566,002, discarding the low bit
These bits as a double5.59284287 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,132,004 to the power 21,281,433,056,016
1,132,004 to the power 31,450,587,345,142,336,064
1,132,004 to the power 41,642,070,677,050,504,993,792,256
1,132,004 to the power 51,858,830,574,703,879,854,992,808,961,024
First ten multiples1,132,004, 2,264,008, 3,396,012, 4,528,016, 5,660,020, 6,792,024, 7,924,028, 9,056,032, 10,188,036, 11,320,040
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1253the total stopping time
Highest value reached5,439,7964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,132,004 → 566,002 → 283,001 → 849,004 → 424,502 → 212,251 → 636,754 → 318,377 → 955,132 → 477,566 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,200,400%
1,132,004% as a decimal11,320.04
1,132,004% of 1001,132,004
1,132,004% of 1,00011,320,040
As a fraction of 1001,132,004/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,004
Nerdulate something else
Nothing in mind? Surprise me · today’s page