Recognised as Number
3,973,456
- Positive
- Even
- Composite
- 7 digits
3,973,456 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,973,456
Digit count7
Digit sum37
Digit product68,040
Multiplicative persistence2times 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 factorisation2^4 × 31 × 8,011
Distinct prime factors32, 31, 8,011
Number of divisors20
Sum of divisors σ(n)7,947,904
Aliquot sum3,974,448sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,922,400integers below n that share no factor with it
Carmichael function λ(n)16,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,922,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 31, 62, 124, 248, 496, 8,011, 16,022, 32,044, 64,088, 128,176, 248,341, 496,682, 993,364, 1,986,728, 3,973,45620 in total
Arithmetic
Previous number3,973,455
Next number3,973,457
Double7,946,912
Half1,986,728
Square15,788,352,583,936
Cube62,734,324,304,756,002,816
Square root1,993.352954196≈irrational, shown to 9 decimal places
Cube root158.388192501≈
Negation-3,973,456
Reciprocal2.51670083 × 10^-7≈
Representations
Decimal3,973,456
Binary111100101000010101000022 bits
Octal17120520
Hexadecimal3CA150
Base 362D5XS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-three thousand, four hundred and fifty-six
Ordinalthree million, nine hundred and seventy-three thousand, four hundred and fifty-sixth
Scientific notation3.973456 × 10^6
Engineering notation3.973456 × 10^6
In other bases
Ternary21110212120001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004122311base 5; one hand: 10 digits
Septenary45526264base 7: 8 digits
Nonary7425501base 9; each digit is two ternary digits: 7 digits
Duodecimal13b7554base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14gdcgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:23:44:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11110T0TT0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011110000101010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001010000101010000
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 44 trailing zeros
Power of twoNo
Bytes33c a1 50
Gray code1000101111000111111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001010000101010000
64-bit0000000000000000000000000000000000000000001111001010000101010000
One's complement11111111110000110101111010101111at 32 bits, every bit flipped
Bits reversed00001010100001010011110000000000at 32 bits
Rotated left by 100000000011110010100001010100000at 32 bits, wrapping
Shifted left by 111110010100001010100000= 7,946,912, no wrap
Shifted right by 1111100101000010101000= 1,986,728, discarding the low bit
These bits as a double1.9631481 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,973,456 to the power 215,788,352,583,936
3,973,456 to the power 362,734,324,304,756,002,816
3,973,456 to the power 4249,272,077,314,678,567,925,252,096
3,973,456 to the power 5990,471,631,238,473,443,794,000,492,363,776
First ten multiples3,973,456, 7,946,912, 11,920,368, 15,893,824, 19,867,280, 23,840,736, 27,814,192, 31,787,648, 35,761,104, 39,734,560
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 4
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 56
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached3,973,456
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,973,456 → 1,986,728 → 993,364 → 496,682 → 248,341 → 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,345,600%
3,973,456% as a decimal39,734.56
3,973,456% of 1003,973,456
3,973,456% of 1,00039,734,560
As a fraction of 1003,973,456/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,456
Nerdulate something else
Nothing in mind? Surprise me · today’s page