Recognised as Number

20,461

Positive
Odd
Composite
5 digits

20,461 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value20,461

Digit count5

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 37 × 79

Distinct prime factors37, 37, 79

Number of divisors8

Sum of divisors σ(n)24,320

Aliquot sum3,859sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)468the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,848

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 37, 79, 259, 553, 2,923, 20,4618 in total

Arithmetic

Previous number20,460

Next number20,462

Double40,922

Half10,230.5

Square418,652,521

Cube8,566,049,232,181

Square root143.041951888≈irrational, shown to 9 decimal places

Cube root27.351151711≈

Negation-20,461

Reciprocal0.0000488735≈

Representations

Decimal20,461

Binary10011111110110115 bits

Octal47755

Hexadecimal4FED

Base 36FSD

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

In wordstwenty thousand, four hundred and sixty-one

Ordinaltwenty thousand, four hundred and sixty-first

Scientific notation2.0461 × 10^4

Engineering notation20.461 × 10^3

In other bases

Ternary1001001211base 3; the most digit-efficient integer base after e: 10 digits

Quinary1123321base 5; one hand: 7 digits

Septenary113440base 7: 6 digits

Nonary31054base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal5:41:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0100111111101101

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes24f ed

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

At each machine width

16-bit0100111111101101

32-bit00000000000000000100111111101101

64-bit0000000000000000000000000000000000000000000000000100111111101101

One's complement1011000000010010at 16 bits, every bit flipped

Bits reversed1011011111110010at 16 bits

Rotated left by 11001111111011010at 16 bits, wrapping

Shifted left by 11001111111011010= 40,922, no wrap

Shifted right by 110011111110110= 10,230, discarding the low bit

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

Nearest landmarks

Next prime20,477+16

Previous prime20,443−18

Distance to nearest prime16

Nearest square below20,449

Nearest square above20,736

Powers & multiples

20,461 to the power 2418,652,521

20,461 to the power 38,566,049,232,181

20,461 to the power 4175,269,933,339,655,441

20,461 to the power 53,586,198,106,062,689,978,301

First ten multiples20,461, 40,922, 61,383, 81,844, 102,305, 122,766, 143,227, 163,688, 184,149, 204,610

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 161the total stopping time

Highest value reached61,3843× the starting value

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

First steps20,461 → 61,384 → 30,692 → 15,346 → 7,673 → 23,020 → 11,510 → 5,755 → 17,266 → 8,633 → …

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

As a percentage & fraction

As a percentage2,046,100%

20,461% as a decimal204.61

20,461% of 10020,461

20,461% of 1,000204,610

As a fraction of 10020,461/100

Read another way

As seconds5 hours, 41 minutes and 1 second

As bytes19.981 KiB

As a 24-bit colour#004FED

Keep nerding

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