Nerdulator> put something in

Recognised as Number

3,960,971

  • Positive
  • Odd
  • Composite
  • 7 digits

3,960,971 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,960,971
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation7 × 719 × 787
Distinct prime factors37, 719, 787
Number of divisors8
Sum of divisors σ(n)4,538,880
Aliquot sum577,909sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,386,088integers below n that share no factor with it
Carmichael function λ(n)282,174the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,386,088
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 719, 787, 5,033, 5,509, 565,853, 3,960,9718 in total

Arithmetic

Previous number3,960,970
Next number3,960,972
Double7,921,942
Cube62,144,827,702,666,578,611
Square root1,990.218832189≈irrational, shown to 9 decimal places
Cube root158.222127884≈
Negation-3,960,971
Reciprocal2.52463348 × 10^-7≈

Representations

Decimal3,960,971
Binary111100011100001000101122 bits
Octal17070213
Hexadecimal3C708B
Base 362CWAZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and sixty thousand, nine hundred and seventy-one
Ordinalthree million, nine hundred and sixty thousand, nine hundred and seventy-first
Scientific notation3.960971 × 10^6
Engineering notation3.960971 × 10^6

In other bases

Ternary21110020102122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003222341base 5; one hand: 10 digits
Septenary45445010base 7: 8 digits
Nonary7406378base 9; each digit is two ternary digits: 7 digits
Duodecimal13b028bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14f28bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:20:16:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11101T0110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011011000110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111000111000010001011
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 8b
Gray code1000100100100011001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111000111000010001011
64-bit0000000000000000000000000000000000000000001111000111000010001011
One's complement11111111110000111000111101110100at 32 bits, every bit flipped
Bits reversed11010001000011100011110000000000at 32 bits
Rotated left by 100000000011110001110000100010110at 32 bits, wrapping
Shifted left by 111110001110000100010110= 7,921,942, no wrap
Shifted right by 1111100011100001000101= 1,980,485, discarding the low bit
These bits as a double1.9569797 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,960,977+6
Previous prime3,960,967−4
Distance to nearest prime4
Nearest square below3,960,100
Nearest square above3,964,081

Powers & multiples

3,960,971 to the power 215,689,291,262,841
3,960,971 to the power 362,144,827,702,666,578,611
3,960,971 to the power 4246,153,860,330,258,940,547,391,281
3,960,971 to the power 5975,008,302,306,206,085,998,940,989,693,851
First ten multiples3,960,971, 7,921,942, 11,882,913, 15,843,884, 19,804,855, 23,765,826, 27,726,797, 31,687,768, 35,648,739, 39,609,710
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 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 197the total stopping time
Highest value reached17,824,3724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,960,971 → 11,882,914 → 5,941,457 → 17,824,372 → 8,912,186 → 4,456,093 → 13,368,280 → 6,684,140 → 3,342,070 → 1,671,035 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage396,097,100%
3,960,971% as a decimal39,609.71
3,960,971% of 1003,960,971
3,960,971% of 1,00039,609,710
As a fraction of 1003,960,971/100

Read another way

As bytes3.777 MiB
As a 24-bit colour#3C708B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3960971” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.