Recognised as Number
1,041,172
- Positive
- Even
- Composite
- 7 digits
1,041,172 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,041,172
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 11 × 23,663
Distinct prime factors32, 11, 23,663
Number of divisors12
Sum of divisors σ(n)1,987,776
Aliquot sum946,604sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)473,240integers below n that share no factor with it
Carmichael function λ(n)118,310the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 473,240
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 23,663, 47,326, 94,652, 260,293, 520,586, 1,041,17212 in total
Arithmetic
Previous number1,041,171
Next number1,041,173
Double2,082,344
Half520,586
Square1,084,039,133,584
Cube1,128,671,192,791,920,448
Square root1,020.378361197≈irrational, shown to 9 decimal places
Cube root101.353984518≈
Negation-1,041,172
Reciprocal9.60456101 × 10^-7≈
Representations
Decimal1,041,172
Binary1111111000110001010020 bits
Octal3761424
HexadecimalFE314
Base 36MBDG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-one thousand, one hundred and seventy-two
Ordinalone million, forty-one thousand, one hundred and seventy-second
Scientific notation1.041172 × 10^6
Engineering notation1.041172 × 10^6
In other bases
Ternary1221220012221base 3; the most digit-efficient integer base after e: 13 digits
Quinary231304142base 5; one hand: 9 digits
Septenary11564326base 7: 8 digits
Nonary1856187base 9; each digit is two ternary digits: 7 digits
Duodecimal422644base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6a2icbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:49:12:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T0T01T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000010011100010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111110001100010100
Bit length20 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits9within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes30f e3 14
Gray code10000001001010011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111110001100010100
64-bit0000000000000000000000000000000000000000000011111110001100010100
One's complement11111111111100000001110011101011at 32 bits, every bit flipped
Bits reversed00101000110001111111000000000000at 32 bits
Rotated left by 100000000000111111100011000101000at 32 bits, wrapping
Shifted left by 1111111100011000101000= 2,082,344, no wrap
Shifted right by 11111111000110001010= 520,586, discarding the low bit
These bits as a double5.14407317 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,041,172 to the power 21,084,039,133,584
1,041,172 to the power 31,128,671,192,791,920,448
1,041,172 to the power 41,175,140,843,141,549,396,685,056
1,041,172 to the power 51,223,523,741,935,373,268,445,373,125,632
First ten multiples1,041,172, 2,082,344, 3,123,516, 4,164,688, 5,205,860, 6,247,032, 7,288,204, 8,329,376, 9,370,548, 10,411,720
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
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 7
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached1,041,172
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,041,172 → 520,586 → 260,293 → 780,880 → 390,440 → 195,220 → 97,610 → 48,805 → 146,416 → 73,208 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,117,200%
1,041,172% as a decimal10,411.72
1,041,172% of 1001,041,172
1,041,172% of 1,00010,411,720
As a fraction of 1001,041,172/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,041,172
Nerdulate something else
Nothing in mind? Surprise me · today’s page