Recognised as Number
3,940,171
- Positive
- Odd
- Prime
- 7 digits
3,940,171 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,940,171
Digit count7
Digit sum25
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 factorisation3,940,171
Distinct prime factors13,940,171
Number of divisors2
Sum of divisors σ(n)3,940,172
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,940,170integers below n that share no factor with it
Carmichael function λ(n)3,940,170the 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, 3,940,1712 in total
Arithmetic
Previous number3,940,170
Next number3,940,172
Double7,880,342
Half1,970,085.5
Square15,524,947,509,241
Cube61,170,947,952,433,620,211
Square root1,984.986397938≈irrational, shown to 9 decimal places
Cube root157.944687683≈
Negation-3,940,171
Reciprocal2.53796092 × 10^-7≈
Representations
Decimal3,940,171
Binary111100000111110100101122 bits
Octal17017513
Hexadecimal3C1F4B
Base 362CG97
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and forty thousand, one hundred and seventy-one
Ordinalthree million, nine hundred and forty thousand, one hundred and seventy-first
Scientific notation3.940171 × 10^6
Engineering notation3.940171 × 10^6
In other bases
Ternary21102011220021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2002041141base 5; one hand: 10 digits
Septenary45330244base 7: 8 digits
Nonary7364807base 9; each digit is two ternary digits: 7 digits
Duodecimal13a0237base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14ca8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:14:29:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111T1TT0T01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000110001101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000001111101001011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes33c 1f 4b
Gray code1000100001000011101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000001111101001011
64-bit0000000000000000000000000000000000000000001111000001111101001011
One's complement11111111110000111110000010110100at 32 bits, every bit flipped
Bits reversed11010010111110000011110000000000at 32 bits
Rotated left by 100000000011110000011111010010110at 32 bits, wrapping
Shifted left by 111110000011111010010110= 7,880,342, no wrap
Shifted right by 1111100000111110100101= 1,970,085, discarding the low bit
These bits as a double1.94670313 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,940,171 to the power 215,524,947,509,241
3,940,171 to the power 361,170,947,952,433,620,211
3,940,171 to the power 4241,023,995,164,688,329,780,396,081
3,940,171 to the power 5949,675,756,052,045,181,039,153,006,869,851
First ten multiples3,940,171, 7,880,342, 11,820,513, 15,760,684, 19,700,855, 23,641,026, 27,581,197, 31,521,368, 35,461,539, 39,401,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1260the total stopping time
Highest value reached17,730,7724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,940,171 → 11,820,514 → 5,910,257 → 17,730,772 → 8,865,386 → 4,432,693 → 13,298,080 → 6,649,040 → 3,324,520 → 1,662,260 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage394,017,100%
3,940,171% as a decimal39,401.71
3,940,171% of 1003,940,171
3,940,171% of 1,00039,401,710
As a fraction of 1003,940,171/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 3,940,171
Nerdulate something else
Nothing in mind? Surprise me · today’s page