Recognised as Number
3,936,799
- Positive
- Odd
- Prime
- 7 digits
3,936,799 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,936,799
Digit count7
Digit sum46
Digit product275,562
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,936,799
Distinct prime factors13,936,799
Number of divisors2
Sum of divisors σ(n)3,936,800
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,936,798integers below n that share no factor with it
Carmichael function λ(n)3,936,798the 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,936,7992 in total
Arithmetic
Previous number3,936,798
Next number3,936,800
Double7,873,598
Half1,968,399.5
Square15,498,386,366,401
Cube61,014,031,948,861,090,399
Square root1,984.136840039≈irrational, shown to 9 decimal places
Cube root157.899618448≈
Negation-3,936,799
Reciprocal2.54013476 × 10^-7≈
Representations
Decimal3,936,799
Binary111100000100100001111122 bits
Octal17011037
Hexadecimal3C121F
Base 362CDNJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and thirty-six thousand, seven hundred and ninety-nine
Ordinalthree million, nine hundred and thirty-six thousand, seven hundred and ninety-ninth
Scientific notation3.936799 × 10^6
Engineering notation3.936799 × 10^6
In other bases
Ternary21102000021101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2001434144base 5; one hand: 10 digits
Septenary45314356base 7: 8 digits
Nonary7360241base 9; each digit is two ternary digits: 7 digits
Duodecimal139a2a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14c1jjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:13:33:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111T0001T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000001011001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000001001000011111
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 12 1f
Gray code1000100001101100010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000001001000011111
64-bit0000000000000000000000000000000000000000001111000001001000011111
One's complement11111111110000111110110111100000at 32 bits, every bit flipped
Bits reversed11111000010010000011110000000000at 32 bits
Rotated left by 100000000011110000010010000111110at 32 bits, wrapping
Shifted left by 111110000010010000111110= 7,873,598, no wrap
Shifted right by 1111100000100100001111= 1,968,399, discarding the low bit
These bits as a double1.94503714 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,936,799 to the power 215,498,386,366,401
3,936,799 to the power 361,014,031,948,861,090,399
3,936,799 to the power 4240,199,979,962,244,391,821,692,801
3,936,799 to the power 5945,619,040,915,383,759,479,248,397,283,999
First ten multiples3,936,799, 7,873,598, 11,810,397, 15,747,196, 19,683,995, 23,620,794, 27,557,593, 31,494,392, 35,431,191, 39,367,990
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached59,790,14815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,936,799 → 11,810,398 → 5,905,199 → 17,715,598 → 8,857,799 → 26,573,398 → 13,286,699 → 39,860,098 → 19,930,049 → 59,790,148 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage393,679,900%
3,936,799% as a decimal39,367.99
3,936,799% of 1003,936,799
3,936,799% of 1,00039,367,990
As a fraction of 1003,936,799/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,936,799
Nerdulate something else
Nothing in mind? Surprise me · today’s page