Nerdulator> put something in

Recognised as Number

38,508

  • Positive
  • Even
  • Composite
  • 5 digits

38,508 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value38,508
Digit count5
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 3,209
Distinct prime factors32, 3, 3,209
Number of divisors12
Sum of divisors σ(n)89,880
Aliquot sum51,372sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)12,832integers below n that share no factor with it
Carmichael function λ(n)3,208the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,832
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 3,209, 6,418, 9,627, 12,836, 19,254, 38,50812 in total

Arithmetic

Previous number38,507
Next number38,509
Double77,016
Half19,254
Square root196.234553532≈irrational, shown to 9 decimal places
Cube root33.768905731≈
Negation-38,508
Reciprocal0.0000259686≈

Representations

Decimal38,508
Binary100101100110110016 bits
Octal113154
Hexadecimal966C
Base 36TPO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-eight thousand, five hundred and eight
Ordinalthirty-eight thousand, five hundred and eighth
Scientific notation3.8508 × 10^4
Engineering notation38.508 × 10^3

In other bases

Ternary1221211020base 3; the most digit-efficient integer base after e: 10 digits
Quinary2213013base 5; one hand: 7 digits
Septenary220161base 7: 6 digits
Nonary57736base 9; each digit is two ternary digits: 5 digits
Duodecimal1a350base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4g58base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:41:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T00TT111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101110111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001011001101100
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes296 6c
Gray code1101110101011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001011001101100
32-bit00000000000000001001011001101100
64-bit0000000000000000000000000000000000000000000000001001011001101100
One's complement0110100110010011at 16 bits, every bit flipped
Bits reversed0011011001101001at 16 bits
Rotated left by 10010110011011001at 16 bits, wrapping
Shifted left by 110010110011011000= 77,016, no wrap
Shifted right by 1100101100110110= 19,254, discarding the low bit
These bits as a double1.90254799 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime38,543+35
Previous prime38,501−7
Distance to nearest prime7
Nearest square below38,416
Nearest square above38,809

Powers & multiples

38,508 to the power 21,482,866,064
38,508 to the power 357,102,206,392,512
38,508 to the power 42,198,891,763,762,852,096
38,508 to the power 584,674,924,038,979,908,512,768
First ten multiples38,508, 77,016, 115,524, 154,032, 192,540, 231,048, 269,556, 308,064, 346,572, 385,080
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time
Highest value reached109,6722× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps38,508 → 19,254 → 9,627 → 28,882 → 14,441 → 43,324 → 21,662 → 10,831 → 32,494 → 16,247 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,850,800%
38,508% as a decimal385.08
38,508% of 10038,508
38,508% of 1,000385,080
As a fraction of 10038,508/100

Read another way

As bytes37.605 KiB
As a 24-bit colour#00966C

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