Nerdulator> put something in

Number

10,661

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value10,661
Digit count5
Digit sum14
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 1,523
Distinct prime factors27, 1,523
Number of divisors4
Sum of divisors σ(n)12,192
Aliquot sum1,531sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,132integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 7, 1,523, 10,6614 in total

Arithmetic

Previous number10,660
Next number10,662
Double21,322
Square root103.252118622irrational, shown to 9 decimal places
Cube root22.008949527
Negation-10,661
Reciprocal0.0000937998

Representations

Decimal10,661
Binary1010011010010114 bits
Octal24645
Hexadecimal29A5
Base 36885
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten thousand, six hundred and sixty-one
Ordinalten thousand, six hundred and sixty-first
Scientific notation1.0661 × 10^4
Engineering notation10.661 × 10^3

Nearest landmarks

Next prime10,663+2
Previous prime10,657−4
Distance to nearest prime2
Nearest square below10,609
Nearest square above10,816

Powers & multiples

10,661 to the power 2113,656,921
10,661 to the power 31,211,696,434,781
10,661 to the power 412,917,895,691,200,241
10,661 to the power 5137,717,685,963,885,769,301
First ten multiples10,661, 21,322, 31,983, 42,644, 53,305, 63,966, 74,627, 85,288, 95,949, 106,610
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

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

Collatz (3n + 1) trajectory

Steps to reach 155the total stopping time
Highest value reached31,9843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,661 → 31,984 → 15,992 → 7,996 → 3,998 → 1,999 → 5,998 → 2,999 → 8,998 → 4,499 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,066,100%
10,661% as a decimal106.61
10,661% of 10010,661
10,661% of 1,000106,610
As a fraction of 10010,661/100

Read another way

As bytes10.411 KiB
As a 24-bit colour#0029A5

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 “10661” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.