Nerdulator> put something in

Recognised as Number

25,262

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value25,262
Digit count5
Digit sum17
Digit product240
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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 17 × 743
Distinct prime factors32, 17, 743
Number of divisors8
Sum of divisors σ(n)40,176
Aliquot sum14,914sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,872integers below n that share no factor with it
Carmichael function λ(n)5,936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,872
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 17, 34, 743, 1,486, 12,631, 25,2628 in total

Arithmetic

Previous number25,261
Next number25,263
Double50,524
Half12,631
Square root158.940240342≈irrational, shown to 9 decimal places
Cube root29.341968303≈
Negation-25,262
Reciprocal0.0000395851≈

Representations

Decimal25,262
Binary11000101010111015 bits
Octal61256
Hexadecimal62AE
Base 36JHQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-five thousand, two hundred and sixty-two
Ordinaltwenty-five thousand, two hundred and sixty-second
Scientific notation2.5262 × 10^4
Engineering notation25.262 × 10^3

In other bases

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

Bit-level

0110001010101110
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes262 ae
Gray code101001111111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110001010101110
32-bit00000000000000000110001010101110
64-bit0000000000000000000000000000000000000000000000000110001010101110
One's complement1001110101010001at 16 bits, every bit flipped
Bits reversed0111010101000110at 16 bits
Rotated left by 11100010101011100at 16 bits, wrapping
Shifted left by 11100010101011100= 50,524, no wrap
Shifted right by 111000101010111= 12,631, discarding the low bit
These bits as a double1.24810863 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime25,301+39
Previous prime25,261−1
Distance to nearest prime1
Nearest square below24,964
Nearest square above25,281

Powers & multiples

25,262 to the power 2638,168,644
25,262 to the power 316,121,416,284,728
25,262 to the power 4407,259,218,184,798,736
25,262 to the power 510,288,182,369,784,385,668,832
First ten multiples25,262, 50,524, 75,786, 101,048, 126,310, 151,572, 176,834, 202,096, 227,358, 252,620
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 164the total stopping time
Highest value reached85,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps25,262 → 12,631 → 37,894 → 18,947 → 56,842 → 28,421 → 85,264 → 42,632 → 21,316 → 10,658 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,526,200%
25,262% as a decimal252.62
25,262% of 10025,262
25,262% of 1,000252,620
As a fraction of 10025,262/100

Read another way

As bytes24.67 KiB
As a 24-bit colour#0062AE

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