Recognised as Number
4,171,116
- Positive
- Even
- Composite
- 7 digits
4,171,116 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,171,116
Digit count7
Digit sum21
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 193 × 1,801
Distinct prime factors42, 3, 193, 1,801
Number of divisors24
Sum of divisors σ(n)9,788,464
Aliquot sum5,617,348sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,382,400integers below n that share no factor with it
Carmichael function λ(n)14,400the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,382,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 193, 386, 579, 772, 1,158, 1,801, 2,316, 3,602, 5,403, 7,204, 10,806, 21,612, 347,593, 695,186, 1,042,779, 1,390,372, 2,085,558, 4,171,11624 in total
Arithmetic
Previous number4,171,115
Next number4,171,117
Double8,342,232
Half2,085,558
Square17,398,208,685,456
Cube72,569,946,619,244,488,896
Square root2,042.331021162≈irrational, shown to 9 decimal places
Cube root160.97215418≈
Negation-4,171,116
Reciprocal2.39743992 × 10^-7≈
Representations
Decimal4,171,116
Binary111111101001010110110022 bits
Octal17722554
Hexadecimal3FA56C
Base 362HEGC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-one thousand, one hundred and sixteen
Ordinalfour million, one hundred and seventy-one thousand, one hundred and sixteenth
Scientific notation4.171116 × 10^6
Engineering notation4.171116 × 10^6
In other bases
Ternary21211220200210base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031433431base 5; one hand: 10 digits
Septenary50311455base 7: 8 digits
Nonary7756623base 9; each digit is two ternary digits: 7 digits
Duodecimal1491a10base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1617fgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:18:38:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT0T1T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111101010111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111010010101101100
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes33f a5 6c
Gray code1000000111011111011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111010010101101100
64-bit0000000000000000000000000000000000000000001111111010010101101100
One's complement11111111110000000101101010010011at 32 bits, every bit flipped
Bits reversed00110110101001011111110000000000at 32 bits
Rotated left by 100000000011111110100101011011000at 32 bits, wrapping
Shifted left by 111111110100101011011000= 8,342,232, no wrap
Shifted right by 1111111101001010110110= 2,085,558, discarding the low bit
These bits as a double2.06080512 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,171,116 to the power 217,398,208,685,456
4,171,116 to the power 372,569,946,619,244,488,896
4,171,116 to the power 4302,697,665,462,676,595,545,927,936
4,171,116 to the power 51,262,587,075,574,017,750,507,148,748,696,576
First ten multiples4,171,116, 8,342,232, 12,513,348, 16,684,464, 20,855,580, 25,026,696, 29,197,812, 33,368,928, 37,540,044, 41,711,160
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 16
Collatz (3n + 1) trajectory
Steps to reach 1229the total stopping time
Highest value reached7,918,6121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,171,116 → 2,085,558 → 1,042,779 → 3,128,338 → 1,564,169 → 4,692,508 → 2,346,254 → 1,173,127 → 3,519,382 → 1,759,691 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage417,111,600%
4,171,116% as a decimal41,711.16
4,171,116% of 1004,171,116
4,171,116% of 1,00041,711,160
As a fraction of 1004,171,116/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 4,171,116
Nerdulate something else
Nothing in mind? Surprise me · today’s page