Recognised as Number

3,972,992

Positive
Even
Composite
7 digits

3,972,992 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,972,992

Digit count7

Digit sum41

Digit product61,236

Multiplicative persistence4times 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^7 × 31,039

Distinct prime factors22, 31,039

Number of divisors16

Sum of divisors σ(n)7,915,200

Aliquot sum3,942,208sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,986,432integers below n that share no factor with it

Carmichael function λ(n)496,608the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,986,432

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 64, 128, 31,039, 62,078, 124,156, 248,312, 496,624, 993,248, 1,986,496, 3,972,99216 in total

Arithmetic

Previous number3,972,991

Next number3,972,993

Double7,945,984

Half1,986,496

Square15,784,665,432,064

Cube62,712,349,484,266,815,488

Square root1,993.236563983≈irrational, shown to 9 decimal places

Cube root158.382027005≈

Negation-3,972,992

Reciprocal2.51699475 × 10^-7≈

Representations

Decimal3,972,992

Binary111100100111111000000022 bits

Octal17117600

Hexadecimal3C9F80

Base 362D5KW

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, nine hundred and seventy-two thousand, nine hundred and ninety-two

Ordinalthree million, nine hundred and seventy-two thousand, nine hundred and ninety-second

Scientific notation3.972992 × 10^6

Engineering notation3.972992 × 10^6

In other bases

Ternary21110211220212base 3; the most digit-efficient integer base after e: 14 digits

Quinary2004113432base 5; one hand: 10 digits

Septenary45525032base 7: 8 digits

Nonary7424825base 9; each digit is two ternary digits: 7 digits

Duodecimal13b7228base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal14gc9cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal18:23:36:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T11110TT0T10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011011110000010000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111001001111110000000

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 even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 77 trailing zeros

Power of twoNo

Bytes33c 9f 80

Gray code1000101101000001000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111001001111110000000

64-bit0000000000000000000000000000000000000000001111001001111110000000

One's complement11111111110000110110000001111111at 32 bits, every bit flipped

Bits reversed00000001111110010011110000000000at 32 bits

Rotated left by 100000000011110010011111100000000at 32 bits, wrapping

Shifted left by 111110010011111100000000= 7,945,984, no wrap

Shifted right by 1111100100111111000000= 1,986,496, discarding the low bit

These bits as a double1.96291886 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,973,007+15

Previous prime3,972,979−13

Distance to nearest prime13

Nearest square below3,972,049

Nearest square above3,976,036

Powers & multiples

3,972,992 to the power 215,784,665,432,064

3,972,992 to the power 362,712,349,484,266,815,488

3,972,992 to the power 4249,155,662,802,196,183,799,300,096

3,972,992 to the power 5989,893,455,067,823,020,665,148,887,007,232

First ten multiples3,972,992, 7,945,984, 11,918,976, 15,891,968, 19,864,960, 23,837,952, 27,810,944, 31,783,936, 35,756,928, 39,729,920

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 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 8

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1128the total stopping time

Highest value reached5,734,3121× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,972,992 → 1,986,496 → 993,248 → 496,624 → 248,312 → 124,156 → 62,078 → 31,039 → 93,118 → 46,559 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage397,299,200%

3,972,992% as a decimal39,729.92

3,972,992% of 1003,972,992

3,972,992% of 1,00039,729,920

As a fraction of 1003,972,992/100

Read another way

As seconds45 days, 23 hours and 36 minutes

As bytes3.789 MiB

As a 24-bit colour#3C9F80

Keep nerding

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