Recognised as Number
3,996,959
- Positive
- Odd
- Prime
- 7 digits
3,996,959 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,996,959
Digit count7
Digit sum50
Digit product590,490
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,996,959
Distinct prime factors13,996,959
Number of divisors2
Sum of divisors σ(n)3,996,960
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,996,958integers below n that share no factor with it
Carmichael function λ(n)3,996,958the 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,996,9592 in total
Arithmetic
Previous number3,996,958
Next number3,996,960
Double7,993,918
Half1,998,479.5
Square15,975,681,247,681
Cube63,854,142,944,049,802,079
Square root1,999.23960545≈irrational, shown to 9 decimal places
Cube root158.69986761≈
Negation-3,996,959
Reciprocal2.50190207 × 10^-7≈
Representations
Decimal3,996,959
Binary111100111111010001111122 bits
Octal17176437
Hexadecimal3CFD1F
Base 362DO2N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and ninety-six thousand, nine hundred and fifty-nine
Ordinalthree million, nine hundred and ninety-six thousand, nine hundred and fifty-ninth
Scientific notation3.996959 × 10^6
Engineering notation3.996959 × 10^6
In other bases
Ternary21112001210112base 3; the most digit-efficient integer base after e: 14 digits
Quinary2010400314base 5; one hand: 10 digits
Septenary45654641base 7: 8 digits
Nonary7461715base 9; each digit is two ternary digits: 7 digits
Duodecimal140907bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14jc7jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:30:15:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT01TT11TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010000110101100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001111110100011111
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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 fd 1f
Gray code1000101000001110010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001111110100011111
64-bit0000000000000000000000000000000000000000001111001111110100011111
One's complement11111111110000110000001011100000at 32 bits, every bit flipped
Bits reversed11111000101111110011110000000000at 32 bits
Rotated left by 100000000011110011111101000111110at 32 bits, wrapping
Shifted left by 111110011111101000111110= 7,993,918, no wrap
Shifted right by 1111100111111010001111= 1,998,479, discarding the low bit
These bits as a double1.97476013 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,996,959 to the power 215,975,681,247,681
3,996,959 to the power 363,854,142,944,049,802,079
3,996,959 to the power 4255,222,391,327,506,352,867,877,761
3,996,959 to the power 51,020,113,434,017,998,464,652,439,827,728,799
First ten multiples3,996,959, 7,993,918, 11,990,877, 15,987,836, 19,984,795, 23,981,754, 27,978,713, 31,975,672, 35,972,631, 39,969,590
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached60,703,82815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,996,959 → 11,990,878 → 5,995,439 → 17,986,318 → 8,993,159 → 26,979,478 → 13,489,739 → 40,469,218 → 20,234,609 → 60,703,828 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage399,695,900%
3,996,959% as a decimal39,969.59
3,996,959% of 1003,996,959
3,996,959% of 1,00039,969,590
As a fraction of 1003,996,959/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,996,959
Nerdulate something else
Nothing in mind? Surprise me · today’s page