Nerdulator> put something in

Recognised as Number

38,162

  • Positive
  • Even
  • Composite
  • 5 digits

38,162 is an even 5-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,162
Digit count5
Digit sum20
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
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,081
Distinct prime factors22, 19,081
Number of divisors4
Sum of divisors σ(n)57,246
Aliquot sum19,084sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,080integers below n that share no factor with it
Carmichael function λ(n)19,080the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 19,081, 38,1624 in total

Arithmetic

Previous number38,161
Next number38,163
Double76,324
Half19,081
Square root195.350966212≈irrational, shown to 9 decimal places
Cube root33.667461777≈
Negation-38,162
Reciprocal0.0000262041≈

Representations

Decimal38,162
Binary100101010001001016 bits
Octal112422
Hexadecimal9512
Base 36TG2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-eight thousand, one hundred and sixty-two
Ordinalthirty-eight thousand, one hundred and sixty-second
Scientific notation3.8162 × 10^4
Engineering notation38.162 × 10^3

In other bases

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

Bit-level

1001010100010010
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes295 12
Gray code1101111110011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001010100010010
32-bit00000000000000001001010100010010
64-bit0000000000000000000000000000000000000000000000001001010100010010
One's complement0110101011101101at 16 bits, every bit flipped
Bits reversed0100100010101001at 16 bits
Rotated left by 10010101000100101at 16 bits, wrapping
Shifted left by 110010101000100100= 76,324, no wrap
Shifted right by 1100101010001001= 19,081, discarding the low bit
These bits as a double1.88545332 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime38,167+5
Previous prime38,153−9
Distance to nearest prime5
Nearest square below38,025
Nearest square above38,416

Powers & multiples

38,162 to the power 21,456,338,244
38,162 to the power 355,576,780,067,528
38,162 to the power 42,120,921,080,937,003,536
38,162 to the power 580,938,590,290,717,928,940,832
First ten multiples38,162, 76,324, 114,486, 152,648, 190,810, 228,972, 267,134, 305,296, 343,458, 381,620
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time
Highest value reached163,0244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps38,162 → 19,081 → 57,244 → 28,622 → 14,311 → 42,934 → 21,467 → 64,402 → 32,201 → 96,604 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,816,200%
38,162% as a decimal381.62
38,162% of 10038,162
38,162% of 1,000381,620
As a fraction of 10038,162/100

Read another way

As bytes37.268 KiB
As a 24-bit colour#009512

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