Recognised as Number

38,499

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value38,499

Digit count5

Digit sum33

Digit product7,776

Multiplicative persistence3times 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 factorisation3 × 41 × 313

Distinct prime factors33, 41, 313

Number of divisors8

Sum of divisors σ(n)52,752

Aliquot sum14,253sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,960

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 41, 123, 313, 939, 12,833, 38,4998 in total

Arithmetic

Previous number38,498

Next number38,500

Double76,998

Half19,249.5

Square1,482,173,001

Cube57,062,178,365,499

Square root196.211620451≈irrational, shown to 9 decimal places

Cube root33.76627473≈

Negation-38,499

Reciprocal0.0000259747≈

Representations

Decimal38,499

Binary100101100110001116 bits

Octal113143

Hexadecimal9663

Base 36TPF

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

In wordsthirty-eight thousand, four hundred and ninety-nine

Ordinalthirty-eight thousand, four hundred and ninety-ninth

Scientific notation3.8499 × 10^4

Engineering notation38.499 × 10^3

In other bases

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

Quinary2212444base 5; one hand: 7 digits

Septenary220146base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001011001100011

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes296 63

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

At each machine width

16-bit1001011001100011

32-bit00000000000000001001011001100011

64-bit0000000000000000000000000000000000000000000000001001011001100011

One's complement0110100110011100at 16 bits, every bit flipped

Bits reversed1100011001101001at 16 bits

Rotated left by 10010110011000111at 16 bits, wrapping

Shifted left by 110010110011000110= 76,998, no wrap

Shifted right by 1100101100110001= 19,249, discarding the low bit

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

Nearest landmarks

Next prime38,501+2

Previous prime38,461−38

Distance to nearest prime2

Nearest square below38,416

Nearest square above38,809

Powers & multiples

38,499 to the power 21,482,173,001

38,499 to the power 357,062,178,365,499

38,499 to the power 42,196,836,804,893,346,001

38,499 to the power 584,576,020,151,588,927,692,499

First ten multiples38,499, 76,998, 115,497, 153,996, 192,495, 230,994, 269,493, 307,992, 346,491, 384,990

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time

Highest value reached173,2484× the starting value

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

First steps38,499 → 115,498 → 57,749 → 173,248 → 86,624 → 43,312 → 21,656 → 10,828 → 5,414 → 2,707 → …

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

As a percentage & fraction

As a percentage3,849,900%

38,499% as a decimal384.99

38,499% of 10038,499

38,499% of 1,000384,990

As a fraction of 10038,499/100

Read another way

As seconds10 hours, 41 minutes and 39 seconds

As bytes37.597 KiB

As a 24-bit colour#009663

Keep nerding

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