Recognised as Number
3,966,007
- Positive
- Odd
- Prime
- 7 digits
3,966,007 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 value3,966,007
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,966,007
Distinct prime factors13,966,007
Number of divisors2
Sum of divisors σ(n)3,966,008
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,966,006integers below n that share no factor with it
Carmichael function λ(n)3,966,006the 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,966,0072 in total
Arithmetic
Previous number3,966,006
Next number3,966,008
Double7,932,014
Half1,983,003.5
Square15,729,211,524,049
Cube62,382,163,008,859,002,343
Square root1,991.483617809≈irrational, shown to 9 decimal places
Cube root158.28915431≈
Negation-3,966,007
Reciprocal2.52142772 × 10^-7≈
Representations
Decimal3,966,007
Binary111100100001000011011122 bits
Octal17102067
Hexadecimal3C8437
Base 362D06V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty-six thousand and seven
Ordinalthree million, nine hundred and sixty-six thousand and seventh
Scientific notation3.966007 × 10^6
Engineering notation3.966007 × 10^6
In other bases
Ternary21110111100011base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003403012base 5; one hand: 10 digits
Septenary45465463base 7: 8 digits
Nonary7414304base 9; each digit is two ternary digits: 7 digits
Duodecimal13b3187base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14ff07base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:21:40:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110111100011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011000010001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001000010000110111
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 84 37
Gray code1000101100011000101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001000010000110111
64-bit0000000000000000000000000000000000000000001111001000010000110111
One's complement11111111110000110111101111001000at 32 bits, every bit flipped
Bits reversed11101100001000010011110000000000at 32 bits
Rotated left by 100000000011110010000100001101110at 32 bits, wrapping
Shifted left by 111110010000100001101110= 7,932,014, no wrap
Shifted right by 1111100100001000011011= 1,983,003, discarding the low bit
These bits as a double1.95946781 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,966,007 to the power 215,729,211,524,049
3,966,007 to the power 362,382,163,008,859,002,343
3,966,007 to the power 4247,408,095,168,275,865,305,354,401
3,966,007 to the power 5981,222,237,294,048,259,732,092,691,846,807
First ten multiples3,966,007, 7,932,014, 11,898,021, 15,864,028, 19,830,035, 23,796,042, 27,762,049, 31,728,056, 35,694,063, 39,660,070
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached33,881,4888× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,966,007 → 11,898,022 → 5,949,011 → 17,847,034 → 8,923,517 → 26,770,552 → 13,385,276 → 6,692,638 → 3,346,319 → 10,038,958 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage396,600,700%
3,966,007% as a decimal39,660.07
3,966,007% of 1003,966,007
3,966,007% of 1,00039,660,070
As a fraction of 1003,966,007/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,966,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page