Recognised as Number
3,967,667
- Positive
- Odd
- Composite
- 7 digits
3,967,667 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,967,667
Digit count7
Digit sum44
Digit product285,768
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 107 × 3,371
Distinct prime factors311, 107, 3,371
Number of divisors8
Sum of divisors σ(n)4,370,112
Aliquot sum402,445sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,572,200integers below n that share no factor with it
Carmichael function λ(n)178,610the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,572,200
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 107, 1,177, 3,371, 37,081, 360,697, 3,967,6678 in total
Arithmetic
Previous number3,967,666
Next number3,967,668
Double7,935,334
Half1,983,833.5
Square15,742,381,422,889
Cube62,460,527,273,009,729,963
Square root1,991.900348913≈irrational, shown to 9 decimal places
Cube root158.311235574≈
Negation-3,967,667
Reciprocal2.5203728 × 10^-7≈
Representations
Decimal3,967,667
Binary111100100010101011001122 bits
Octal17105263
Hexadecimal3C8AB3
Base 362D1GZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty-seven thousand, six hundred and sixty-seven
Ordinalthree million, nine hundred and sixty-seven thousand, six hundred and sixty-seventh
Scientific notation3.967667 × 10^6
Engineering notation3.967667 × 10^6
In other bases
Ternary21110120121122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003431132base 5; one hand: 10 digits
Septenary45503354base 7: 8 digits
Nonary7416548base 9; each digit is two ternary digits: 7 digits
Duodecimal13b412bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14fj37base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:22:7:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1111TT1T0TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011001111111110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001000101010110011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 8a b3
Gray code1000101100111111101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001000101010110011
64-bit0000000000000000000000000000000000000000001111001000101010110011
One's complement11111111110000110111010101001100at 32 bits, every bit flipped
Bits reversed11001101010100010011110000000000at 32 bits
Rotated left by 100000000011110010001010101100110at 32 bits, wrapping
Shifted left by 111110010001010101100110= 7,935,334, no wrap
Shifted right by 1111100100010101011001= 1,983,833, discarding the low bit
These bits as a double1.96028796 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,967,667 to the power 215,742,381,422,889
3,967,667 to the power 362,460,527,273,009,729,963
3,967,667 to the power 4247,822,572,863,720,696,253,106,321
3,967,667 to the power 5983,277,444,206,480,103,740,473,597,323,107
First ten multiples3,967,667, 7,935,334, 11,903,001, 15,870,668, 19,838,335, 23,806,002, 27,773,669, 31,741,336, 35,709,003, 39,676,670
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1260the total stopping time
Highest value reached17,854,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,967,667 → 11,903,002 → 5,951,501 → 17,854,504 → 8,927,252 → 4,463,626 → 2,231,813 → 6,695,440 → 3,347,720 → 1,673,860 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage396,766,700%
3,967,667% as a decimal39,676.67
3,967,667% of 1003,967,667
3,967,667% of 1,00039,676,670
As a fraction of 1003,967,667/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,967,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page