Recognised as Number

38,813

Positive
Odd
Composite
5 digits

38,813 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,813

Digit count5

Digit sum23

Digit product576

Multiplicative persistence3times 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 factorisation37 × 1,049

Distinct prime factors237, 1,049

Number of divisors4

Sum of divisors σ(n)39,900

Aliquot sum1,087sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 37, 1,049, 38,8134 in total

Arithmetic

Previous number38,812

Next number38,814

Double77,626

Half19,406.5

Square1,506,448,969

Cube58,469,803,833,797

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

Cube root33.857826155≈

Negation-38,813

Reciprocal0.0000257646≈

Representations

Decimal38,813

Binary100101111001110116 bits

Octal113635

Hexadecimal979D

Base 36TY5

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

In wordsthirty-eight thousand, eight hundred and thirteen

Ordinalthirty-eight thousand, eight hundred and thirteenth

Scientific notation3.8813 × 10^4

Engineering notation38.813 × 10^3

In other bases

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

Quinary2220223base 5; one hand: 7 digits

Septenary221105base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001011110011101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes297 9d

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

At each machine width

16-bit1001011110011101

32-bit00000000000000001001011110011101

64-bit0000000000000000000000000000000000000000000000001001011110011101

One's complement0110100001100010at 16 bits, every bit flipped

Bits reversed1011100111101001at 16 bits

Rotated left by 10010111100111011at 16 bits, wrapping

Shifted left by 110010111100111010= 77,626, no wrap

Shifted right by 1100101111001110= 19,406, discarding the low bit

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

Nearest landmarks

Next prime38,821+8

Previous prime38,803−10

Distance to nearest prime8

Nearest square below38,809

Nearest square above39,204

Powers & multiples

38,813 to the power 21,506,448,969

38,813 to the power 358,469,803,833,797

38,813 to the power 42,269,388,496,201,162,961

38,813 to the power 588,081,775,703,055,738,005,293

First ten multiples38,813, 77,626, 116,439, 155,252, 194,065, 232,878, 271,691, 310,504, 349,317, 388,130

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached116,4403× the starting value

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

First steps38,813 → 116,440 → 58,220 → 29,110 → 14,555 → 43,666 → 21,833 → 65,500 → 32,750 → 16,375 → …

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

As a percentage & fraction

As a percentage3,881,300%

38,813% as a decimal388.13

38,813% of 10038,813

38,813% of 1,000388,130

As a fraction of 10038,813/100

Read another way

As seconds10 hours, 46 minutes and 53 seconds

As bytes37.903 KiB

As a 24-bit colour#00979D

Keep nerding

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