Recognised as Number
3,973,460
- Positive
- Even
- Composite
- 7 digits
3,973,460 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,973,460
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^2 × 5 × 198,673
Distinct prime factors32, 5, 198,673
Number of divisors12
Sum of divisors σ(n)8,344,308
Aliquot sum4,370,848sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,589,376integers below n that share no factor with it
Carmichael function λ(n)198,672the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,589,376
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 198,673, 397,346, 794,692, 993,365, 1,986,730, 3,973,46012 in total
Arithmetic
Previous number3,973,459
Next number3,973,461
Double7,946,920
Half1,986,730
Square15,788,384,371,600
Cube62,734,513,765,177,736,000
Square root1,993.35395753≈irrational, shown to 9 decimal places
Cube root158.38824565≈
Negation-3,973,460
Reciprocal2.51669829 × 10^-7≈
Representations
Decimal3,973,460
Binary111100101000010101010022 bits
Octal17120524
Hexadecimal3CA154
Base 362D5XW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-three thousand, four hundred and sixty
Ordinalthree million, nine hundred and seventy-three thousand, four hundred and sixtieth
Scientific notation3.97346 × 10^6
Engineering notation3.97346 × 10^6
In other bases
Ternary21110212120012base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004122320base 5; one hand: 10 digits
Septenary45526301base 7: 8 digits
Nonary7425505base 9; each digit is two ternary digits: 7 digits
Duodecimal13b7558base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14gdd0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:23:44:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11110T0TT01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011110000101010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001010000101010100
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; 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 a1 54
Gray code1000101111000111111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001010000101010100
64-bit0000000000000000000000000000000000000000001111001010000101010100
One's complement11111111110000110101111010101011at 32 bits, every bit flipped
Bits reversed00101010100001010011110000000000at 32 bits
Rotated left by 100000000011110010100001010101000at 32 bits, wrapping
Shifted left by 111110010100001010101000= 7,946,920, no wrap
Shifted right by 1111100101000010101010= 1,986,730, discarding the low bit
These bits as a double1.96315008 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,973,460 to the power 215,788,384,371,600
3,973,460 to the power 362,734,513,765,177,736,000
3,973,460 to the power 4249,273,081,065,383,126,886,560,000
3,973,460 to the power 5990,476,616,690,057,239,358,670,697,600,000
First ten multiples3,973,460, 7,946,920, 11,920,380, 15,893,840, 19,867,300, 23,840,760, 27,814,220, 31,787,680, 35,761,140, 39,734,600
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 8
Divisible by 100No, remainder 60
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached3,973,460
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,973,460 → 1,986,730 → 993,365 → 2,980,096 → 1,490,048 → 745,024 → 372,512 → 186,256 → 93,128 → 46,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage397,346,000%
3,973,460% as a decimal39,734.6
3,973,460% of 1003,973,460
3,973,460% of 1,00039,734,600
As a fraction of 1003,973,460/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,973,460
Nerdulate something else
Nothing in mind? Surprise me · today’s page