Nerdulator> put something in

Recognised as Number

38,713

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value38,713
Digit count5
Digit sum22
Digit product504
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 factorisation38,713
Distinct prime factors138,713
Number of divisors2
Sum of divisors σ(n)38,714
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,712integers below n that share no factor with it
Carmichael function λ(n)38,712the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 38,7132 in total

Arithmetic

Previous number38,712
Next number38,714
Double77,426
Square root196.756194312≈irrational, shown to 9 decimal places
Cube root33.82872341≈
Negation-38,713
Reciprocal0.0000258311≈

Representations

Decimal38,713
Binary100101110011100116 bits
Octal113471
Hexadecimal9739
Base 36TVD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-eight thousand, seven hundred and thirteen
Ordinalthirty-eight thousand, seven hundred and thirteenth
Scientific notation3.8713 × 10^4
Engineering notation38.713 × 10^3

In other bases

Ternary1222002211base 3; the most digit-efficient integer base after e: 10 digits
Quinary2214323base 5; one hand: 7 digits
Septenary220603base 7: 6 digits
Nonary58084base 9; each digit is two ternary digits: 5 digits
Duodecimal1a4a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4gfdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:45:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T00T010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001011100111001
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
Bytes297 39
Gray code1101110010100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001011100111001
32-bit00000000000000001001011100111001
64-bit0000000000000000000000000000000000000000000000001001011100111001
One's complement0110100011000110at 16 bits, every bit flipped
Bits reversed1001110011101001at 16 bits
Rotated left by 10010111001110011at 16 bits, wrapping
Shifted left by 110010111001110010= 77,426, no wrap
Shifted right by 1100101110011100= 19,356, discarding the low bit
These bits as a double1.91267633 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime38,723+10
Previous prime38,711−2
Distance to nearest prime0, it is prime
Nearest square below38,416
Nearest square above38,809

Powers & multiples

38,713 to the power 21,498,696,369
38,713 to the power 358,019,032,533,097
38,713 to the power 42,246,090,806,453,784,161
38,713 to the power 586,952,913,390,245,346,224,793
First ten multiples38,713, 77,426, 116,139, 154,852, 193,565, 232,278, 270,991, 309,704, 348,417, 387,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1124the total stopping time
Highest value reached130,6603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps38,713 → 116,140 → 58,070 → 29,035 → 87,106 → 43,553 → 130,660 → 65,330 → 32,665 → 97,996 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,871,300%
38,713% as a decimal387.13
38,713% of 10038,713
38,713% of 1,000387,130
As a fraction of 10038,713/100

Read another way

As bytes37.806 KiB
As a 24-bit colour#009739

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