Nerdulator> put something in

Recognised as Number

11,461

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value11,461
Digit count5
Digit sum13
Digit product24
Multiplicative persistence2times 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 factorisation73 × 157
Distinct prime factors273, 157
Number of divisors4
Sum of divisors σ(n)11,692
Aliquot sum231sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,232integers below n that share no factor with it
Carmichael function λ(n)936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,232
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 73, 157, 11,4614 in total

Arithmetic

Previous number11,460
Next number11,462
Double22,922
Square root107.056060081≈irrational, shown to 9 decimal places
Cube root22.546242345≈
Negation-11,461
Reciprocal0.0000872524≈

Representations

Decimal11,461
Binary1011001100010114 bits
Octal26305
Hexadecimal2CC5
Base 368UD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseleven thousand, four hundred and sixty-one
Ordinaleleven thousand, four hundred and sixty-first
Scientific notation1.1461 × 10^4
Engineering notation11.461 × 10^3

In other bases

Ternary120201111base 3; the most digit-efficient integer base after e: 9 digits
Quinary331321base 5; one hand: 6 digits
Septenary45262base 7: 5 digits
Nonary16644base 9; each digit is two ternary digits: 5 digits
Duodecimal6771base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18d1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:11:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT1T01111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110111000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010110011000101
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes22c c5
Gray code11101010100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010110011000101
32-bit00000000000000000010110011000101
64-bit0000000000000000000000000000000000000000000000000010110011000101
One's complement1101001100111010at 16 bits, every bit flipped
Bits reversed1010001100110100at 16 bits
Rotated left by 10101100110001010at 16 bits, wrapping
Shifted left by 1101100110001010= 22,922, no wrap
Shifted right by 11011001100010= 5,730, discarding the low bit
These bits as a double5.66248637 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime11,467+6
Previous prime11,447−14
Distance to nearest prime6
Nearest square below11,449
Nearest square above11,664

Powers & multiples

11,461 to the power 2131,354,521
11,461 to the power 31,505,454,165,181
11,461 to the power 417,254,010,187,139,441
11,461 to the power 5197,748,210,754,805,133,301
First ten multiples11,461, 22,922, 34,383, 45,844, 57,305, 68,766, 80,227, 91,688, 103,149, 114,610
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

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 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 129the total stopping time
Highest value reached34,3843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps11,461 → 34,384 → 17,192 → 8,596 → 4,298 → 2,149 → 6,448 → 3,224 → 1,612 → 806 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,146,100%
11,461% as a decimal114.61
11,461% of 10011,461
11,461% of 1,000114,610
As a fraction of 10011,461/100

Read another way

As bytes11.192 KiB
As a 24-bit colour#002CC5

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “11461” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.