Recognised as Number
3,973,463
- Positive
- Odd
- Composite
- 7 digits
3,973,463 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,973,463
Digit count7
Digit sum35
Digit product40,824
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 53 × 73 × 79
Distinct prime factors413, 53, 73, 79
Number of divisors16
Sum of divisors σ(n)4,475,520
Aliquot sum502,057sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,504,384integers below n that share no factor with it
Carmichael function λ(n)936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,504,384
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 53, 73, 79, 689, 949, 1,027, 3,869, 4,187, 5,767, 50,297, 54,431, 74,971, 305,651, 3,973,46316 in total
Arithmetic
Previous number3,973,462
Next number3,973,464
Double7,946,926
Half1,986,731.5
Square15,788,408,212,369
Cube62,734,655,860,744,363,847
Square root1,993.35471003≈irrational, shown to 9 decimal places
Cube root158.388285512≈
Negation-3,973,463
Reciprocal2.51669639 × 10^-7≈
Representations
Decimal3,973,463
Binary111100101000010101011122 bits
Octal17120527
Hexadecimal3CA157
Base 362D5XZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and seventy-three thousand, four hundred and sixty-three
Ordinalthree million, nine hundred and seventy-three thousand, four hundred and sixty-third
Scientific notation3.973463 × 10^6
Engineering notation3.973463 × 10^6
In other bases
Ternary21110212120022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2004122323base 5; one hand: 10 digits
Septenary45526304base 7: 8 digits
Nonary7425508base 9; each digit is two ternary digits: 7 digits
Duodecimal13b755bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14gdd3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:23:44:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11110T0TT010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011110011010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111001010000101010111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 a1 57
Gray code1000101111000111111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111001010000101010111
64-bit0000000000000000000000000000000000000000001111001010000101010111
One's complement11111111110000110101111010101000at 32 bits, every bit flipped
Bits reversed11101010100001010011110000000000at 32 bits
Rotated left by 100000000011110010100001010101110at 32 bits, wrapping
Shifted left by 111110010100001010101110= 7,946,926, no wrap
Shifted right by 1111100101000010101011= 1,986,731, discarding the low bit
These bits as a double1.96315156 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,973,463 to the power 215,788,408,212,369
3,973,463 to the power 362,734,655,860,744,363,847
3,973,463 to the power 4249,273,833,880,400,882,204,592,161
3,973,463 to the power 5990,480,355,791,919,330,607,305,381,823,543
First ten multiples3,973,463, 7,946,926, 11,920,389, 15,893,852, 19,867,315, 23,840,778, 27,814,241, 31,787,704, 35,761,167, 39,734,630
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached26,820,8806× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,973,463 → 11,920,390 → 5,960,195 → 17,880,586 → 8,940,293 → 26,820,880 → 13,410,440 → 6,705,220 → 3,352,610 → 1,676,305 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage397,346,300%
3,973,463% as a decimal39,734.63
3,973,463% of 1003,973,463
3,973,463% of 1,00039,734,630
As a fraction of 1003,973,463/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,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page