Nerdulator> put something in

Number

12,161

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value12,161
Digit count5
Digit sum11
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation12,161
Distinct prime factors112,161
Number of divisors2
Sum of divisors σ(n)12,162
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,160integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 12,1612 in total

Arithmetic

Previous number12,160
Next number12,162
Double24,322
Square root110.27692415irrational, shown to 9 decimal places
Cube root22.99621866
Negation-12,161
Reciprocal0.0000822301

Representations

Decimal12,161
Binary1011111000000114 bits
Octal27601
Hexadecimal2F81
Base 369DT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, one hundred and sixty-one
Ordinaltwelve thousand, one hundred and sixty-first
Scientific notation1.2161 × 10^4
Engineering notation12.161 × 10^3

Nearest landmarks

Next prime12,163+2
Previous prime12,157−4
Distance to nearest prime0, it is prime
Nearest square below12,100
Nearest square above12,321

Powers & multiples

12,161 to the power 2147,889,921
12,161 to the power 31,798,489,329,281
12,161 to the power 421,871,428,733,386,241
12,161 to the power 5265,978,444,826,710,076,801
First ten multiples12,161, 24,322, 36,483, 48,644, 60,805, 72,966, 85,127, 97,288, 109,449, 121,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 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time
Highest value reached36,4843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,161 → 36,484 → 18,242 → 9,121 → 27,364 → 13,682 → 6,841 → 20,524 → 10,262 → 5,131 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,216,100%
12,161% as a decimal121.61
12,161% of 10012,161
12,161% of 1,000121,610
As a fraction of 10012,161/100

Read another way

As bytes11.876 KiB
As a 24-bit colour#002F81

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