Recognised as Number

61,245

Positive
Odd
Composite
5 digits

61,245 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value61,245

Digit count5

Digit sum18

Digit product240

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 1,361

Distinct prime factors33, 5, 1,361

Number of divisors12

Sum of divisors σ(n)106,236

Aliquot sum44,991sum 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

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 45, 1,361, 4,083, 6,805, 12,249, 20,415, 61,24512 in total

Arithmetic

Previous number61,244

Next number61,246

Double122,490

Half30,622.5

Square3,750,950,025

Cube229,726,934,281,125

Square root247.477271684≈irrational, shown to 9 decimal places

Cube root39.417603169≈

Negation-61,245

Reciprocal0.0000163279≈

Representations

Decimal61,245

Binary111011110011110116 bits

Octal167475

HexadecimalEF3D

Base 361B99

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

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

Ordinalsixty-one thousand, two hundred and forty-fifth

Scientific notation6.1245 × 10^4

Engineering notation61.245 × 10^3

In other bases

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

Quinary3424440base 5; one hand: 7 digits

Septenary343362base 7: 6 digits

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

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

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

Sexagesimal17:0:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110111100111101

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2ef 3d

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

At each machine width

16-bit1110111100111101

32-bit00000000000000001110111100111101

64-bit0000000000000000000000000000000000000000000000001110111100111101

One's complement0001000011000010at 16 bits, every bit flipped

Bits reversed1011110011110111at 16 bits

Rotated left by 11101111001111011at 16 bits, wrapping

Shifted left by 111101111001111010= 122,490, no wrap

Shifted right by 1111011110011110= 30,622, discarding the low bit

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

Nearest landmarks

Next prime61,253+8

Previous prime61,231−14

Distance to nearest prime8

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,245 to the power 23,750,950,025

61,245 to the power 3229,726,934,281,125

61,245 to the power 414,069,626,090,047,500,625

61,245 to the power 5861,694,249,884,959,175,778,125

First ten multiples61,245, 122,490, 183,735, 244,980, 306,225, 367,470, 428,715, 489,960, 551,205, 612,450

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 5

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 9

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached183,7363× the starting value

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

First steps61,245 → 183,736 → 91,868 → 45,934 → 22,967 → 68,902 → 34,451 → 103,354 → 51,677 → 155,032 → …

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

As a percentage & fraction

As a percentage6,124,500%

61,245% as a decimal612.45

61,245% of 10061,245

61,245% of 1,000612,450

As a fraction of 10061,245/100

Read another way

As seconds17 hours and 45 seconds

As bytes59.81 KiB

As a 24-bit colour#00EF3D

Keep nerding

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