Nerdulator> put something in

Number

38

Positive
Even
Composite
2 digits

38 is an even 2-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value38

Digit count2

Digit sum11

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 19

Distinct prime factors22, 19

Number of divisors4

Sum of divisors σ(n)60

Aliquot sum22sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 19, 384 in total

Arithmetic

Previous number37

Next number39

Double76

Half19

Square1,444

Square root6.164414003≈irrational, shown to 9 decimal places

Cube root3.361975407≈

Negation-38

Reciprocal0.0263157895≈

38 factorial523,022,617,466,601,111,760,007,224,100,074,291,200,000,000

Representations

Decimal38

Binary1001106 bits

Octal46

Hexadecimal26

Base 3612

Roman numeralXXXVIII

In wordsthirty-eight

Ordinalthirty-eighth

Scientific notation3.8 × 10^1

Engineering notation38

Nearest landmarks

Next prime41+3

Previous prime37−1

Distance to nearest prime1

Nearest square below36

Nearest square above49

Powers & multiples

38 to the power 21,444

38 to the power 354,872

38 to the power 42,085,136

38 to the power 579,235,168

First ten multiples38, 76, 114, 152, 190, 228, 266, 304, 342, 380

Powers of twoBetween 2^5 (32) and 2^6 (64)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 5

Divisible by 12No, remainder 2

Divisible by 100No, remainder 38

Collatz (3n + 1) trajectory

Steps to reach 121the total stopping time

Highest value reached882× the starting value

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

First steps38 → 19 → 58 → 29 → 88 → 44 → 22 → 11 → 34 → 17 → …

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

As a percentage & fraction

As a percentage3,800%

38% as a decimal0.38

38% of 10038

38% of 1,000380

As a fraction of 10038/100

Read another way

As seconds38 seconds

As bytes38 B

As a 24-bit colour#000026

Keep nerding

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

Neighbouring numbers

Derived from 38

Nearby primes

37
41

Other readings

Nerdulate something else

Nothing in mind? Surprise me · today’s page