Number

65,025

Positive
Odd
Composite
Perfect square
5 digits

65,025 is an odd 5-digit integer and a composite number. It has 27 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value65,025

Digit count5

Digit sum18

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 255²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5^2 × 17^2

Distinct prime factors33, 5, 17

Number of divisors27

Sum of divisors σ(n)123,721

Aliquot sum58,696sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 17, 25, 45, 51, 75, 85, 153, 225, 255, 289, 425, 765, 867, 1,275, 1,445, 2,601, 3,825, 4,335, 7,225, 13,005, 21,675, 65,02527 in total

Arithmetic

Previous number65,024

Next number65,026

Double130,050

Half32,512.5

Square4,228,250,625

Cube274,941,996,890,625

Square root255exact

Cube root40.212411702≈

Negation-65,025

Reciprocal0.0000153787≈

Representations

Decimal65,025

Binary111111100000000116 bits

Octal177001

HexadecimalFE01

Base 361E69

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

In wordssixty-five thousand and twenty-five

Ordinalsixty-five thousand and twenty-fifth

Scientific notation6.5025 × 10^4

Engineering notation65.025 × 10^3

Nearest landmarks

Next prime65,027+2

Previous prime65,011−14

Distance to nearest prime2

Nearest square below65,025

Nearest square above65,536

Powers & multiples

65,025 to the power 24,228,250,625

65,025 to the power 3274,941,996,890,625

65,025 to the power 417,878,103,347,812,890,625

65,025 to the power 51,162,523,670,191,533,212,890,625

First ten multiples65,025, 130,050, 195,075, 260,100, 325,125, 390,150, 455,175, 520,200, 585,225, 650,250

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time

Highest value reached312,4964× the starting value

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

First steps65,025 → 195,076 → 97,538 → 48,769 → 146,308 → 73,154 → 36,577 → 109,732 → 54,866 → 27,433 → …

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

As a percentage & fraction

As a percentage6,502,500%

65,025% as a decimal650.25

65,025% of 10065,025

65,025% of 1,000650,250

As a fraction of 10065,025/100

Read another way

As seconds18 hours, 3 minutes and 45 seconds

As bytes63.501 KiB

As a 24-bit colour#00FE01

Keep nerding

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