Number

25,567

Positive
Odd
Composite
5 digits

25,567 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value25,567

Digit count5

Digit sum25

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation37 × 691

Distinct prime factors237, 691

Number of divisors4

Sum of divisors σ(n)26,296

Aliquot sum729sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 37, 691, 25,5674 in total

Arithmetic

Previous number25,566

Next number25,568

Double51,134

Half12,783.5

Square653,671,489

Cube16,712,418,959,263

Square root159.896841745≈irrational, shown to 9 decimal places

Cube root29.459582685≈

Negation-25,567

Reciprocal0.0000391129≈

Representations

Decimal25,567

Binary11000111101111115 bits

Octal61737

Hexadecimal63DF

Base 36JQ7

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

In wordstwenty-five thousand, five hundred and sixty-seven

Ordinaltwenty-five thousand, five hundred and sixty-seventh

Scientific notation2.5567 × 10^4

Engineering notation25.567 × 10^3

Nearest landmarks

Next prime25,577+10

Previous prime25,561−6

Distance to nearest prime6

Nearest square below25,281

Nearest square above25,600

Powers & multiples

25,567 to the power 2653,671,489

25,567 to the power 316,712,418,959,263

25,567 to the power 4427,286,415,531,477,121

25,567 to the power 510,924,431,785,893,275,552,607

First ten multiples25,567, 51,134, 76,701, 102,268, 127,835, 153,402, 178,969, 204,536, 230,103, 255,670

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1201the total stopping time

Highest value reached552,90421× the starting value

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

First steps25,567 → 76,702 → 38,351 → 115,054 → 57,527 → 172,582 → 86,291 → 258,874 → 129,437 → 388,312 → …

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

As a percentage & fraction

As a percentage2,556,700%

25,567% as a decimal255.67

25,567% of 10025,567

25,567% of 1,000255,670

As a fraction of 10025,567/100

Read another way

As seconds7 hours, 6 minutes and 7 seconds

As bytes24.968 KiB

As a 24-bit colour#0063DF

Keep nerding

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