Recognised as Number
4,171,117
- Positive
- Odd
- Prime
- 7 digits
4,171,117 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,171,117
Digit count7
Digit sum22
Digit product196
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,171,117
Distinct prime factors14,171,117
Number of divisors2
Sum of divisors σ(n)4,171,118
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,171,116integers below n that share no factor with it
Carmichael function λ(n)4,171,116the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,171,1172 in total
Arithmetic
Previous number4,171,116
Next number4,171,118
Double8,342,234
Half2,085,558.5
Square17,398,217,027,689
Cube72,569,998,813,883,058,613
Square root2,042.33126598≈irrational, shown to 9 decimal places
Cube root160.972167044≈
Negation-4,171,117
Reciprocal2.39743934 × 10^-7≈
Representations
Decimal4,171,117
Binary111111101001010110110122 bits
Octal17722555
Hexadecimal3FA56D
Base 362HEGD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-one thousand, one hundred and seventeen
Ordinalfour million, one hundred and seventy-one thousand, one hundred and seventeenth
Scientific notation4.171117 × 10^6
Engineering notation4.171117 × 10^6
In other bases
Ternary21211220200211base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031433432base 5; one hand: 10 digits
Septenary50311456base 7: 8 digits
Nonary7756624base 9; each digit is two ternary digits: 7 digits
Duodecimal1491a11base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1617fhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:18:38:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT0T1T01T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111101010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111010010101101101
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33f a5 6d
Gray code1000000111011111011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111010010101101101
64-bit0000000000000000000000000000000000000000001111111010010101101101
One's complement11111111110000000101101010010010at 32 bits, every bit flipped
Bits reversed10110110101001011111110000000000at 32 bits
Rotated left by 100000000011111110100101011011010at 32 bits, wrapping
Shifted left by 111111110100101011011010= 8,342,234, no wrap
Shifted right by 1111111101001010110110= 2,085,558, discarding the low bit
These bits as a double2.06080561 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,171,117 to the power 217,398,217,027,689
4,171,117 to the power 372,569,998,813,883,058,613
4,171,117 to the power 4302,697,955,742,567,461,792,680,721
4,171,117 to the power 51,262,588,589,063,070,763,530,301,030,935,357
First ten multiples4,171,117, 8,342,234, 12,513,351, 16,684,468, 20,855,585, 25,026,702, 29,197,819, 33,368,936, 37,540,053, 41,711,170
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1229the total stopping time
Highest value reached12,513,3523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,171,117 → 12,513,352 → 6,256,676 → 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,700%
4,171,117% as a decimal41,711.17
4,171,117% of 1004,171,117
4,171,117% of 1,00041,711,170
As a fraction of 1004,171,117/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,117
Nerdulate something else
Nothing in mind? Surprise me · today’s page