Recognised as Number

61,253

Positive
Odd
Prime
5 digits

61,253 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value61,253

Digit count5

Digit sum17

Digit product180

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 factorisation61,253

Distinct prime factors161,253

Number of divisors2

Sum of divisors σ(n)61,254

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)61,252the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 61,2532 in total

Arithmetic

Previous number61,252

Next number61,254

Double122,506

Half30,626.5

Square3,751,930,009

Cube229,816,968,841,277

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

Cube root39.419319375≈

Negation-61,253

Reciprocal0.0000163257≈

Representations

Decimal61,253

Binary111011110100010116 bits

Octal167505

HexadecimalEF45

Base 361B9H

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

In wordssixty-one thousand, two hundred and fifty-three

Ordinalsixty-one thousand, two hundred and fifty-third

Scientific notation6.1253 × 10^4

Engineering notation61.253 × 10^3

In other bases

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

Quinary3430003base 5; one hand: 7 digits

Septenary343403base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110111101000101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 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 45

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

At each machine width

16-bit1110111101000101

32-bit00000000000000001110111101000101

64-bit0000000000000000000000000000000000000000000000001110111101000101

One's complement0001000010111010at 16 bits, every bit flipped

Bits reversed1010001011110111at 16 bits

Rotated left by 11101111010001011at 16 bits, wrapping

Shifted left by 111101111010001010= 122,506, no wrap

Shifted right by 1111011110100010= 30,626, discarding the low bit

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

Nearest landmarks

Next prime61,261+8

Previous prime61,231−22

Distance to nearest prime0, it is prime

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,253 to the power 23,751,930,009

61,253 to the power 3229,816,968,841,277

61,253 to the power 414,076,978,792,434,740,081

61,253 to the power 5862,257,181,973,005,134,181,493

First ten multiples61,253, 122,506, 183,759, 245,012, 306,265, 367,518, 428,771, 490,024, 551,277, 612,530

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached183,7603× the starting value

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

First steps61,253 → 183,760 → 91,880 → 45,940 → 22,970 → 11,485 → 34,456 → 17,228 → 8,614 → 4,307 → …

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

As a percentage & fraction

As a percentage6,125,300%

61,253% as a decimal612.53

61,253% of 10061,253

61,253% of 1,000612,530

As a fraction of 10061,253/100

Read another way

As seconds17 hours and 53 seconds

As bytes59.817 KiB

As a 24-bit colour#00EF45

Keep nerding

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