Nerdulator> put something in

Recognised as Number

38,311

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value38,311
Digit count5
Digit sum16
Digit product72
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 13 × 421
Distinct prime factors37, 13, 421
Number of divisors8
Sum of divisors σ(n)47,264
Aliquot sum8,953sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,240integers below n that share no factor with it
Carmichael function λ(n)420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,240
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 13, 91, 421, 2,947, 5,473, 38,3118 in total

Arithmetic

Previous number38,310
Next number38,312
Double76,622
Square root195.731959577≈irrational, shown to 9 decimal places
Cube root33.711222037≈
Negation-38,311
Reciprocal0.0000261022≈

Representations

Decimal38,311
Binary100101011010011116 bits
Octal112647
Hexadecimal95A7
Base 36TK7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-eight thousand, three hundred and eleven
Ordinalthirty-eight thousand, three hundred and eleventh
Scientific notation3.8311 × 10^4
Engineering notation38.311 × 10^3

In other bases

Ternary1221112221base 3; the most digit-efficient integer base after e: 10 digits
Quinary2211221base 5; one hand: 7 digits
Septenary216460base 7: 6 digits
Nonary57487base 9; each digit is two ternary digits: 5 digits
Duodecimal1a207base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4ffbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:38:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T00TTT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101011111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001010110100111
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 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
Bytes295 a7
Gray code1101111101110100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001010110100111
32-bit00000000000000001001010110100111
64-bit0000000000000000000000000000000000000000000000001001010110100111
One's complement0110101001011000at 16 bits, every bit flipped
Bits reversed1110010110101001at 16 bits
Rotated left by 10010101101001111at 16 bits, wrapping
Shifted left by 110010101101001110= 76,622, no wrap
Shifted right by 1100101011010011= 19,155, discarding the low bit
These bits as a double1.8928149 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime38,317+6
Previous prime38,303−8
Distance to nearest prime6
Nearest square below38,025
Nearest square above38,416

Powers & multiples

38,311 to the power 21,467,732,721
38,311 to the power 356,230,308,274,231
38,311 to the power 42,154,239,340,294,063,841
38,311 to the power 582,531,063,366,005,879,812,551
First ten multiples38,311, 76,622, 114,933, 153,244, 191,555, 229,866, 268,177, 306,488, 344,799, 383,110
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time
Highest value reached290,9327× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps38,311 → 114,934 → 57,467 → 172,402 → 86,201 → 258,604 → 129,302 → 64,651 → 193,954 → 96,977 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,831,100%
38,311% as a decimal383.11
38,311% of 10038,311
38,311% of 1,000383,110
As a fraction of 10038,311/100

Read another way

As bytes37.413 KiB
As a 24-bit colour#0095A7

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 “38311” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.