Recognised as Number

38,032

Positive
Even
Composite
5 digits

38,032 is an even 5-digit integer and a composite number. It has 10 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value38,032

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 2,377

Distinct prime factors22, 2,377

Number of divisors10

Sum of divisors σ(n)73,718

Aliquot sum35,686sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,376the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,008

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 2,377, 4,754, 9,508, 19,016, 38,03210 in total

Arithmetic

Previous number38,031

Next number38,033

Double76,064

Half19,016

Square1,446,433,024

Cube55,010,740,768,768

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

Cube root33.629188544≈

Negation-38,032

Reciprocal0.0000262936≈

Representations

Decimal38,032

Binary100101001001000016 bits

Octal112220

Hexadecimal9490

Base 36TCG

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

In wordsthirty-eight thousand and thirty-two

Ordinalthirty-eight thousand and thirty-second

Scientific notation3.8032 × 10^4

Engineering notation38.032 × 10^3

In other bases

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

Quinary2204112base 5; one hand: 7 digits

Septenary215611base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001010010010000

Bit length16 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits11within that length

Bit parityodd5 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes294 90

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

At each machine width

16-bit1001010010010000

32-bit00000000000000001001010010010000

64-bit0000000000000000000000000000000000000000000000001001010010010000

One's complement0110101101101111at 16 bits, every bit flipped

Bits reversed0000100100101001at 16 bits

Rotated left by 10010100100100001at 16 bits, wrapping

Shifted left by 110010100100100000= 76,064, no wrap

Shifted right by 1100101001001000= 19,016, discarding the low bit

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

Nearest landmarks

Next prime38,039+7

Previous prime38,011−21

Distance to nearest prime7

Nearest square below38,025

Nearest square above38,416

Powers & multiples

38,032 to the power 21,446,433,024

38,032 to the power 355,010,740,768,768

38,032 to the power 42,092,168,492,917,784,576

38,032 to the power 579,569,352,122,649,182,994,432

First ten multiples38,032, 76,064, 114,096, 152,128, 190,160, 228,192, 266,224, 304,256, 342,288, 380,320

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 4

Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time

Highest value reached38,032

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

First steps38,032 → 19,016 → 9,508 → 4,754 → 2,377 → 7,132 → 3,566 → 1,783 → 5,350 → 2,675 → …

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

As a percentage & fraction

As a percentage3,803,200%

38,032% as a decimal380.32

38,032% of 10038,032

38,032% of 1,000380,320

As a fraction of 10038,032/100

Read another way

As seconds10 hours, 33 minutes and 52 seconds

As bytes37.141 KiB

As a 24-bit colour#009490

Keep nerding

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