Recognised as Number
3,960,973
- Positive
- Odd
- Composite
- 7 digits
3,960,973 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,960,973
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation67 × 59,119
Distinct prime factors267, 59,119
Number of divisors4
Sum of divisors σ(n)4,020,160
Aliquot sum59,187sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,901,788integers below n that share no factor with it
Carmichael function λ(n)650,298the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,901,788
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 67, 59,119, 3,960,9734 in total
Arithmetic
Previous number3,960,972
Next number3,960,974
Double7,921,946
Half1,980,486.5
Square15,689,307,106,729
Cube62,144,921,838,461,687,317
Square root1,990.219334646≈irrational, shown to 9 decimal places
Cube root158.222154514≈
Negation-3,960,973
Reciprocal2.52463221 × 10^-7≈
Representations
Decimal3,960,973
Binary111100011100001000110122 bits
Octal17070215
Hexadecimal3C708D
Base 362CWB1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty thousand, nine hundred and seventy-three
Ordinalthree million, nine hundred and sixty thousand, nine hundred and seventy-third
Scientific notation3.960973 × 10^6
Engineering notation3.960973 × 10^6
In other bases
Ternary21110020102201base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003222343base 5; one hand: 10 digits
Septenary45445012base 7: 8 digits
Nonary7406381base 9; each digit is two ternary digits: 7 digits
Duodecimal13b0291base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14f28dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:20:16:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11101T0110T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011011000110011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000111000010001101
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 70 8d
Gray code1000100100100011001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000111000010001101
64-bit0000000000000000000000000000000000000000001111000111000010001101
One's complement11111111110000111000111101110010at 32 bits, every bit flipped
Bits reversed10110001000011100011110000000000at 32 bits
Rotated left by 100000000011110001110000100011010at 32 bits, wrapping
Shifted left by 111110001110000100011010= 7,921,946, no wrap
Shifted right by 1111100011100001000110= 1,980,486, discarding the low bit
These bits as a double1.95698068 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,960,973 to the power 215,689,307,106,729
3,960,973 to the power 362,144,921,838,461,687,317
3,960,973 to the power 4246,154,357,489,257,104,997,079,441
3,960,973 to the power 5975,010,763,847,295,182,951,596,744,656,093
First ten multiples3,960,973, 7,921,946, 11,882,919, 15,843,892, 19,804,865, 23,765,838, 27,726,811, 31,687,784, 35,648,757, 39,609,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached11,882,9203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,960,973 → 11,882,920 → 5,941,460 → 2,970,730 → 1,485,365 → 4,456,096 → 2,228,048 → 1,114,024 → 557,012 → 278,506 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage396,097,300%
3,960,973% as a decimal39,609.73
3,960,973% of 1003,960,973
3,960,973% of 1,00039,609,730
As a fraction of 1003,960,973/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,960,973
Nerdulate something else
Nothing in mind? Surprise me · today’s page