Recognised as Number

37,966

Positive
Even
Composite
5 digits

37,966 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value37,966

Digit count5

Digit sum31

Digit product6,804

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 41 × 463

Distinct prime factors32, 41, 463

Number of divisors8

Sum of divisors σ(n)58,464

Aliquot sum20,498sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)18,480integers below n that share no factor with it

Carmichael function λ(n)9,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,480

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 41, 82, 463, 926, 18,983, 37,9668 in total

Arithmetic

Previous number37,965

Next number37,967

Double75,932

Half18,983

Square1,441,417,156

Cube54,724,843,744,696

Square root194.84865922≈irrational, shown to 9 decimal places

Cube root33.609724132≈

Negation-37,966

Reciprocal0.0000263394≈

Representations

Decimal37,966

Binary100101000100111016 bits

Octal112116

Hexadecimal944E

Base 36TAM

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

In wordsthirty-seven thousand, nine hundred and sixty-six

Ordinalthirty-seven thousand, nine hundred and sixty-sixth

Scientific notation3.7966 × 10^4

Engineering notation37.966 × 10^3

In other bases

Ternary1221002011base 3; the most digit-efficient integer base after e: 10 digits

Quinary2203331base 5; one hand: 7 digits

Septenary215455base 7: 6 digits

Nonary57064base 9; each digit is two ternary digits: 5 digits

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

Vigesimal4ei6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal10:32:46base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1001010001001110

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes294 4e

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

At each machine width

16-bit1001010001001110

32-bit00000000000000001001010001001110

64-bit0000000000000000000000000000000000000000000000001001010001001110

One's complement0110101110110001at 16 bits, every bit flipped

Bits reversed0111001000101001at 16 bits

Rotated left by 10010100010011101at 16 bits, wrapping

Shifted left by 110010100010011100= 75,932, no wrap

Shifted right by 1100101000100111= 18,983, discarding the low bit

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

Nearest landmarks

Next prime37,967+1

Previous prime37,963−3

Distance to nearest prime1

Nearest square below37,636

Nearest square above38,025

Powers & multiples

37,966 to the power 21,441,417,156

37,966 to the power 354,724,843,744,696

37,966 to the power 42,077,683,417,611,128,336

37,966 to the power 578,881,328,633,024,098,404,576

First ten multiples37,966, 75,932, 113,898, 151,864, 189,830, 227,796, 265,762, 303,728, 341,694, 379,660

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 4

Divisible by 10No, remainder 6

Divisible by 11No, remainder 5

Divisible by 12No, remainder 10

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time

Highest value reached144,1603× the starting value

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

First steps37,966 → 18,983 → 56,950 → 28,475 → 85,426 → 42,713 → 128,140 → 64,070 → 32,035 → 96,106 → …

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

As a percentage & fraction

As a percentage3,796,600%

37,966% as a decimal379.66

37,966% of 10037,966

37,966% of 1,000379,660

As a fraction of 10037,966/100

Read another way

As seconds10 hours, 32 minutes and 46 seconds

As bytes37.076 KiB

As a 24-bit colour#00944E

Keep nerding

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