Recognised as Number

65,249

Positive
Odd
Composite
5 digits

65,249 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 value65,249

Digit count5

Digit sum26

Digit product2,160

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 factorisation71 × 919

Distinct prime factors271, 919

Number of divisors4

Sum of divisors σ(n)66,240

Aliquot sum991sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)32,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,260

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

SquarefreeYesno repeated prime factor

All divisors1, 71, 919, 65,2494 in total

Arithmetic

Previous number65,248

Next number65,250

Double130,498

Half32,624.5

Square4,257,432,001

Cube277,793,180,633,249

Square root255.438838081≈irrational, shown to 9 decimal places

Cube root40.258533741≈

Negation-65,249

Reciprocal0.0000153259≈

Representations

Decimal65,249

Binary111111101110000116 bits

Octal177341

HexadecimalFEE1

Base 361ECH

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

In wordssixty-five thousand, two hundred and forty-nine

Ordinalsixty-five thousand, two hundred and forty-ninth

Scientific notation6.5249 × 10^4

Engineering notation65.249 × 10^3

In other bases

Ternary10022111122base 3; the most digit-efficient integer base after e: 11 digits

Quinary4041444base 5; one hand: 7 digits

Septenary361142base 7: 6 digits

Nonary108448base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal18:7:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1111111011100001

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2fe e1

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

At each machine width

16-bit1111111011100001

32-bit00000000000000001111111011100001

64-bit0000000000000000000000000000000000000000000000001111111011100001

One's complement0000000100011110at 16 bits, every bit flipped

Bits reversed1000011101111111at 16 bits

Rotated left by 11111110111000011at 16 bits, wrapping

Shifted left by 111111110111000010= 130,498, no wrap

Shifted right by 1111111101110000= 32,624, discarding the low bit

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

Nearest landmarks

Next prime65,257+8

Previous prime65,239−10

Distance to nearest prime8

Nearest square below65,025

Nearest square above65,536

Powers & multiples

65,249 to the power 24,257,432,001

65,249 to the power 3277,793,180,633,249

65,249 to the power 418,125,727,243,138,864,001

65,249 to the power 51,182,685,576,887,567,737,201,249

First ten multiples65,249, 130,498, 195,747, 260,996, 326,245, 391,494, 456,743, 521,992, 587,241, 652,490

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 5

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time

Highest value reached557,4408× the starting value

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

First steps65,249 → 195,748 → 97,874 → 48,937 → 146,812 → 73,406 → 36,703 → 110,110 → 55,055 → 165,166 → …

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

As a percentage & fraction

As a percentage6,524,900%

65,249% as a decimal652.49

65,249% of 10065,249

65,249% of 1,000652,490

As a fraction of 10065,249/100

Read another way

As seconds18 hours, 7 minutes and 29 seconds

As bytes63.72 KiB

As a 24-bit colour#00FEE1

Keep nerding

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