Recognised as Number

25,595

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value25,595

Digit count5

Digit sum26

Digit product2,250

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 5,119

Distinct prime factors25, 5,119

Number of divisors4

Sum of divisors σ(n)30,720

Aliquot sum5,125sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,472

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 5,119, 25,5954 in total

Arithmetic

Previous number25,594

Next number25,596

Double51,190

Half12,797.5

Square655,104,025

Cube16,767,387,519,875

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

Cube root29.470333098≈

Negation-25,595

Reciprocal0.0000390701≈

Representations

Decimal25,595

Binary11000111111101115 bits

Octal61773

Hexadecimal63FB

Base 36JQZ

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

In wordstwenty-five thousand, five hundred and ninety-five

Ordinaltwenty-five thousand, five hundred and ninety-fifth

Scientific notation2.5595 × 10^4

Engineering notation25.595 × 10^3

In other bases

Ternary1022002222base 3; the most digit-efficient integer base after e: 10 digits

Quinary1304340base 5; one hand: 7 digits

Septenary134423base 7: 6 digits

Nonary38088base 9; each digit is two ternary digits: 5 digits

Duodecimal1298bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal33jfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal7:6:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary110T01000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010010000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110001111111011

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes263 fb

Gray code101001000000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110001111111011

32-bit00000000000000000110001111111011

64-bit0000000000000000000000000000000000000000000000000110001111111011

One's complement1001110000000100at 16 bits, every bit flipped

Bits reversed1101111111000110at 16 bits

Rotated left by 11100011111110110at 16 bits, wrapping

Shifted left by 11100011111110110= 51,190, no wrap

Shifted right by 111000111111101= 12,797, discarding the low bit

These bits as a double1.26456102 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime25,601+6

Previous prime25,589−6

Distance to nearest prime6

Nearest square below25,281

Nearest square above25,600

Powers & multiples

25,595 to the power 2655,104,025

25,595 to the power 316,767,387,519,875

25,595 to the power 4429,161,283,571,200,625

25,595 to the power 510,984,383,053,004,879,996,875

First ten multiples25,595, 51,190, 76,785, 102,380, 127,975, 153,570, 179,165, 204,760, 230,355, 255,950

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 177the total stopping time

Highest value reached145,7805× the starting value

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

First steps25,595 → 76,786 → 38,393 → 115,180 → 57,590 → 28,795 → 86,386 → 43,193 → 129,580 → 64,790 → …

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

As a percentage & fraction

As a percentage2,559,500%

25,595% as a decimal255.95

25,595% of 10025,595

25,595% of 1,000255,950

As a fraction of 10025,595/100

Read another way

As seconds7 hours, 6 minutes and 35 seconds

As bytes24.995 KiB

As a 24-bit colour#0063FB

Keep nerding

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