Nerdulator> put something in

Recognised as Number

25,734

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value25,734
Digit count5
Digit sum21
Digit product840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 4,289
Distinct prime factors32, 3, 4,289
Number of divisors8
Sum of divisors σ(n)51,480
Aliquot sum25,746sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)8,576integers below n that share no factor with it
Carmichael function λ(n)4,288the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,576
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 4,289, 8,578, 12,867, 25,7348 in total

Arithmetic

Previous number25,733
Next number25,735
Double51,468
Half12,867
Square root160.418203456≈irrational, shown to 9 decimal places
Cube root29.523585466≈
Negation-25,734
Reciprocal0.0000388591≈

Representations

Decimal25,734
Binary11001001000011015 bits
Octal62206
Hexadecimal6486
Base 36JUU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-five thousand, seven hundred and thirty-four
Ordinaltwenty-five thousand, seven hundred and thirty-fourth
Scientific notation2.5734 × 10^4
Engineering notation25.734 × 10^3

In other bases

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

Bit-level

0110010010000110
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 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
Bytes264 86
Gray code101011011000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110010010000110
32-bit00000000000000000110010010000110
64-bit0000000000000000000000000000000000000000000000000110010010000110
One's complement1001101101111001at 16 bits, every bit flipped
Bits reversed0110000100100110at 16 bits
Rotated left by 11100100100001100at 16 bits, wrapping
Shifted left by 11100100100001100= 51,468, no wrap
Shifted right by 111001001000011= 12,867, discarding the low bit
These bits as a double1.27142853 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime25,741+7
Previous prime25,733−1
Distance to nearest prime1
Nearest square below25,600
Nearest square above25,921

Powers & multiples

25,734 to the power 2662,238,756
25,734 to the power 317,042,052,146,904
25,734 to the power 4438,560,169,948,427,536
25,734 to the power 511,285,907,413,452,834,211,424
First ten multiples25,734, 51,468, 77,202, 102,936, 128,670, 154,404, 180,138, 205,872, 231,606, 257,340
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 34

Collatz (3n + 1) trajectory

Steps to reach 164the total stopping time
Highest value reached57,9042× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps25,734 → 12,867 → 38,602 → 19,301 → 57,904 → 28,952 → 14,476 → 7,238 → 3,619 → 10,858 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,573,400%
25,734% as a decimal257.34
25,734% of 10025,734
25,734% of 1,000257,340
As a fraction of 10025,734/100

Read another way

As bytes25.131 KiB
As a 24-bit colour#006486

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