Nerdulator> put something in

Number

38,567

  • Positive
  • Odd
  • Prime
  • 5 digits

38,567 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value38,567
Digit count5
Digit sum29
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation38,567
Distinct prime factors138,567
Number of divisors2
Sum of divisors σ(n)38,568
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,566integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 38,5672 in total

Arithmetic

Previous number38,566
Next number38,568
Double77,134
Square root196.384826298irrational, shown to 9 decimal places
Cube root33.786143264
Negation-38,567
Reciprocal0.0000259289

Representations

Decimal38,567
Binary100101101010011116 bits
Octal113247
Hexadecimal96A7
Base 36TRB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-eight thousand, five hundred and sixty-seven
Ordinalthirty-eight thousand, five hundred and sixty-seventh
Scientific notation3.8567 × 10^4
Engineering notation38.567 × 10^3

Nearest landmarks

Next prime38,569+2
Previous prime38,561−6
Distance to nearest prime0, it is prime
Nearest square below38,416
Nearest square above38,809

Powers & multiples

38,567 to the power 21,487,413,489
38,567 to the power 357,365,076,030,263
38,567 to the power 42,212,398,887,259,153,121
38,567 to the power 585,325,587,884,923,758,417,607
First ten multiples38,567, 77,134, 115,701, 154,268, 192,835, 231,402, 269,969, 308,536, 347,103, 385,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time
Highest value reached329,4888× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps38,567 → 115,702 → 57,851 → 173,554 → 86,777 → 260,332 → 130,166 → 65,083 → 195,250 → 97,625 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,856,700%
38,567% as a decimal385.67
38,567% of 10038,567
38,567% of 1,000385,670
As a fraction of 10038,567/100

Read another way

As bytes37.663 KiB
As a 24-bit colour#0096A7

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