Recognised as Number
3,960,967
- Positive
- Odd
- Prime
- 7 digits
3,960,967 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,960,967
Digit count7
Digit sum40
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,960,967
Distinct prime factors13,960,967
Number of divisors2
Sum of divisors σ(n)3,960,968
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,960,966integers below n that share no factor with it
Carmichael function λ(n)3,960,966the 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,960,9672 in total
Arithmetic
Previous number3,960,966
Next number3,960,968
Double7,921,934
Half1,980,483.5
Square15,689,259,575,089
Cube62,144,639,431,361,551,063
Square root1,990.217827274≈irrational, shown to 9 decimal places
Cube root158.222074624≈
Negation-3,960,967
Reciprocal2.52463603 × 10^-7≈
Representations
Decimal3,960,967
Binary111100011100001000011122 bits
Octal17070207
Hexadecimal3C7087
Base 362CWAV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty thousand, nine hundred and sixty-seven
Ordinalthree million, nine hundred and sixty thousand, nine hundred and sixty-seventh
Scientific notation3.960967 × 10^6
Engineering notation3.960967 × 10^6
In other bases
Ternary21110020102111base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003222332base 5; one hand: 10 digits
Septenary45445003base 7: 8 digits
Nonary7406374base 9; each digit is two ternary digits: 7 digits
Duodecimal13b0287base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14f287base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:20:16:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11101T011T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011011000110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000111000010000111
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 70 87
Gray code1000100100100011000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000111000010000111
64-bit0000000000000000000000000000000000000000001111000111000010000111
One's complement11111111110000111000111101111000at 32 bits, every bit flipped
Bits reversed11100001000011100011110000000000at 32 bits
Rotated left by 100000000011110001110000100001110at 32 bits, wrapping
Shifted left by 111110001110000100001110= 7,921,934, no wrap
Shifted right by 1111100011100001000011= 1,980,483, discarding the low bit
These bits as a double1.95697772 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,960,967 to the power 215,689,259,575,089
3,960,967 to the power 362,144,639,431,361,551,063
3,960,967 to the power 4246,152,866,014,521,868,829,357,921
3,960,967 to the power 5975,003,379,238,942,643,211,415,356,269,607
First ten multiples3,960,967, 7,921,934, 11,882,901, 15,843,868, 19,804,835, 23,765,802, 27,726,769, 31,687,736, 35,648,703, 39,609,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 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 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 192the total stopping time
Highest value reached26,736,5326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,960,967 → 11,882,902 → 5,941,451 → 17,824,354 → 8,912,177 → 26,736,532 → 13,368,266 → 6,684,133 → 20,052,400 → 10,026,200 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage396,096,700%
3,960,967% as a decimal39,609.67
3,960,967% of 1003,960,967
3,960,967% of 1,00039,609,670
As a fraction of 1003,960,967/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,960,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page