Recognised as Number

38,957

Positive
Odd
Composite
5 digits

38,957 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value38,957

Digit count5

Digit sum32

Digit product7,560

Multiplicative persistence2times 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 factorisation163 × 239

Distinct prime factors2163, 239

Number of divisors4

Sum of divisors σ(n)39,360

Aliquot sum403sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)19,278the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,556

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 163, 239, 38,9574 in total

Arithmetic

Previous number38,956

Next number38,958

Double77,914

Half19,478.5

Square1,517,647,849

Cube59,123,007,253,493

Square root197.375277074≈irrational, shown to 9 decimal places

Cube root33.89964642≈

Negation-38,957

Reciprocal0.0000256693≈

Representations

Decimal38,957

Binary100110000010110116 bits

Octal114055

Hexadecimal982D

Base 36U25

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

In wordsthirty-eight thousand, nine hundred and fifty-seven

Ordinalthirty-eight thousand, nine hundred and fifty-seventh

Scientific notation3.8957 × 10^4

Engineering notation38.957 × 10^3

In other bases

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

Quinary2221312base 5; one hand: 7 digits

Septenary221402base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001100000101101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes298 2d

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

At each machine width

16-bit1001100000101101

32-bit00000000000000001001100000101101

64-bit0000000000000000000000000000000000000000000000001001100000101101

One's complement0110011111010010at 16 bits, every bit flipped

Bits reversed1011010000011001at 16 bits

Rotated left by 10011000001011011at 16 bits, wrapping

Shifted left by 110011000001011010= 77,914, no wrap

Shifted right by 1100110000010110= 19,478, discarding the low bit

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

Nearest landmarks

Next prime38,959+2

Previous prime38,953−4

Distance to nearest prime2

Nearest square below38,809

Nearest square above39,204

Powers & multiples

38,957 to the power 21,517,647,849

38,957 to the power 359,123,007,253,493

38,957 to the power 42,303,254,993,574,326,801

38,957 to the power 589,727,904,784,675,049,186,557

First ten multiples38,957, 77,914, 116,871, 155,828, 194,785, 233,742, 272,699, 311,656, 350,613, 389,570

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time

Highest value reached116,8723× the starting value

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

First steps38,957 → 116,872 → 58,436 → 29,218 → 14,609 → 43,828 → 21,914 → 10,957 → 32,872 → 16,436 → …

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

As a percentage & fraction

As a percentage3,895,700%

38,957% as a decimal389.57

38,957% of 10038,957

38,957% of 1,000389,570

As a fraction of 10038,957/100

Read another way

As seconds10 hours, 49 minutes and 17 seconds

As bytes38.044 KiB

As a 24-bit colour#00982D

Keep nerding

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