Recognised as Number

38,123

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value38,123

Digit count5

Digit sum17

Digit product144

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation67 × 569

Distinct prime factors267, 569

Number of divisors4

Sum of divisors σ(n)38,760

Aliquot sum637sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 67, 569, 38,1234 in total

Arithmetic

Previous number38,122

Next number38,124

Double76,246

Half19,061.5

Square1,453,363,129

Cube55,406,562,566,867

Square root195.251120355≈irrational, shown to 9 decimal places

Cube root33.655988946≈

Negation-38,123

Reciprocal0.0000262309≈

Representations

Decimal38,123

Binary100101001110101116 bits

Octal112353

Hexadecimal94EB

Base 36TEZ

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

In wordsthirty-eight thousand, one hundred and twenty-three

Ordinalthirty-eight thousand, one hundred and twenty-third

Scientific notation3.8123 × 10^4

Engineering notation38.123 × 10^3

In other bases

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

Quinary2204443base 5; one hand: 7 digits

Septenary216101base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001010011101011

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

Bytes294 eb

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

At each machine width

16-bit1001010011101011

32-bit00000000000000001001010011101011

64-bit0000000000000000000000000000000000000000000000001001010011101011

One's complement0110101100010100at 16 bits, every bit flipped

Bits reversed1101011100101001at 16 bits

Rotated left by 10010100111010111at 16 bits, wrapping

Shifted left by 110010100111010110= 76,246, no wrap

Shifted right by 1100101001110101= 19,061, discarding the low bit

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

Nearest landmarks

Next prime38,149+26

Previous prime38,119−4

Distance to nearest prime4

Nearest square below38,025

Nearest square above38,416

Powers & multiples

38,123 to the power 21,453,363,129

38,123 to the power 355,406,562,566,867

38,123 to the power 42,112,264,384,736,670,641

38,123 to the power 580,525,855,139,316,094,846,843

First ten multiples38,123, 76,246, 114,369, 152,492, 190,615, 228,738, 266,861, 304,984, 343,107, 381,230

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 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 23

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time

Highest value reached244,2766× the starting value

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

First steps38,123 → 114,370 → 57,185 → 171,556 → 85,778 → 42,889 → 128,668 → 64,334 → 32,167 → 96,502 → …

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

As a percentage & fraction

As a percentage3,812,300%

38,123% as a decimal381.23

38,123% of 10038,123

38,123% of 1,000381,230

As a fraction of 10038,123/100

Read another way

As seconds10 hours, 35 minutes and 23 seconds

As bytes37.229 KiB

As a 24-bit colour#0094EB

Keep nerding

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