Recognised as Number

36,461

Positive
Odd
Composite
5 digits

36,461 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value36,461

Digit count5

Digit sum20

Digit product432

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation19^2 × 101

Distinct prime factors219, 101

Number of divisors6

Sum of divisors σ(n)38,862

Aliquot sum2,401sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)17,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,200

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

SquarefreeNohas a repeated prime factor

All divisors1, 19, 101, 361, 1,919, 36,4616 in total

Arithmetic

Previous number36,460

Next number36,462

Double72,922

Half18,230.5

Square1,329,404,521

Cube48,471,418,240,181

Square root190.947636801≈irrational, shown to 9 decimal places

Cube root33.159618489≈

Negation-36,461

Reciprocal0.0000274266≈

Representations

Decimal36,461

Binary100011100110110116 bits

Octal107155

Hexadecimal8E6D

Base 36S4T

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

In wordsthirty-six thousand, four hundred and sixty-one

Ordinalthirty-six thousand, four hundred and sixty-first

Scientific notation3.6461 × 10^4

Engineering notation36.461 × 10^3

In other bases

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

Quinary2131321base 5; one hand: 7 digits

Septenary211205base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000111001101101

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes28e 6d

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

At each machine width

16-bit1000111001101101

32-bit00000000000000001000111001101101

64-bit0000000000000000000000000000000000000000000000001000111001101101

One's complement0111000110010010at 16 bits, every bit flipped

Bits reversed1011011001110001at 16 bits

Rotated left by 10001110011011011at 16 bits, wrapping

Shifted left by 110001110011011010= 72,922, no wrap

Shifted right by 1100011100110110= 18,230, discarding the low bit

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

Nearest landmarks

Next prime36,467+6

Previous prime36,457−4

Distance to nearest prime4

Nearest square below36,100

Nearest square above36,481

Powers & multiples

36,461 to the power 21,329,404,521

36,461 to the power 348,471,418,240,181

36,461 to the power 41,767,316,380,455,239,441

36,461 to the power 564,438,122,547,778,485,258,301

First ten multiples36,461, 72,922, 109,383, 145,844, 182,305, 218,766, 255,227, 291,688, 328,149, 364,610

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 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached109,3843× the starting value

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

First steps36,461 → 109,384 → 54,692 → 27,346 → 13,673 → 41,020 → 20,510 → 10,255 → 30,766 → 15,383 → …

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

As a percentage & fraction

As a percentage3,646,100%

36,461% as a decimal364.61

36,461% of 10036,461

36,461% of 1,000364,610

As a fraction of 10036,461/100

Read another way

As seconds10 hours, 7 minutes and 41 seconds

As bytes35.606 KiB

As a 24-bit colour#008E6D

Keep nerding

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