Recognised as Number
3,950,116
- Positive
- Even
- Composite
- 7 digits
3,950,116 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,950,116
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 61 × 16,189
Distinct prime factors32, 61, 16,189
Number of divisors12
Sum of divisors σ(n)7,026,460
Aliquot sum3,076,344sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,942,560integers below n that share no factor with it
Carmichael function λ(n)80,940the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,942,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 61, 122, 244, 16,189, 32,378, 64,756, 987,529, 1,975,058, 3,950,11612 in total
Arithmetic
Previous number3,950,115
Next number3,950,117
Double7,900,232
Half1,975,058
Square15,603,416,413,456
Cube61,635,304,829,455,160,896
Square root1,987.489874188≈irrational, shown to 9 decimal places
Cube root158.077460283≈
Negation-3,950,116
Reciprocal2.53157122 × 10^-7≈
Representations
Decimal3,950,116
Binary111100010001100010010022 bits
Octal17043044
Hexadecimal3C4624
Base 362CNXG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and fifty thousand, one hundred and sixteen
Ordinalthree million, nine hundred and fifty thousand, one hundred and sixteenth
Scientific notation3.950116 × 10^6
Engineering notation3.950116 × 10^6
In other bases
Ternary21102200112121base 3; the most digit-efficient integer base after e: 14 digits
Quinary2002400431base 5; one hand: 10 digits
Septenary45401242base 7: 8 digits
Nonary7380477base 9; each digit is two ternary digits: 7 digits
Duodecimal13a5b44base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14df5gbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:17:15:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110T01TT0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000101101001100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000100011000100100
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes33c 46 24
Gray code1000100110010100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000100011000100100
64-bit0000000000000000000000000000000000000000001111000100011000100100
One's complement11111111110000111011100111011011at 32 bits, every bit flipped
Bits reversed00100100011000100011110000000000at 32 bits
Rotated left by 100000000011110001000110001001000at 32 bits, wrapping
Shifted left by 111110001000110001001000= 7,900,232, no wrap
Shifted right by 1111100010001100010010= 1,975,058, discarding the low bit
These bits as a double1.95161661 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,950,116 to the power 215,603,416,413,456
3,950,116 to the power 361,635,304,829,455,160,896
3,950,116 to the power 4243,466,603,771,708,102,337,863,936
3,950,116 to the power 5961,721,327,024,284,522,374,433,739,416,576
First ten multiples3,950,116, 7,900,232, 11,850,348, 15,800,464, 19,750,580, 23,700,696, 27,650,812, 31,600,928, 35,551,044, 39,501,160
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 16
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached5,624,2961× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,950,116 → 1,975,058 → 987,529 → 2,962,588 → 1,481,294 → 740,647 → 2,221,942 → 1,110,971 → 3,332,914 → 1,666,457 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage395,011,600%
3,950,116% as a decimal39,501.16
3,950,116% of 1003,950,116
3,950,116% of 1,00039,501,160
As a fraction of 1003,950,116/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,950,116
Nerdulate something else
Nothing in mind? Surprise me · today’s page