Nerdulator> put something in

Number

14,161

  • Positive
  • Odd
  • Composite
  • Perfect square
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value14,161
Digit count5
Digit sum13
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 119²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7^2 × 17^2
Distinct prime factors27, 17
Number of divisors9
Sum of divisors σ(n)17,499
Aliquot sum3,338sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,424integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 7, 17, 49, 119, 289, 833, 2,023, 14,1619 in total

Arithmetic

Previous number14,160
Next number14,162
Double28,322
Square root119exact
Cube root24.193459517
Negation-14,161
Reciprocal0.0000706165

Representations

Decimal14,161
Binary1101110101000114 bits
Octal33521
Hexadecimal3751
Base 36AXD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfourteen thousand, one hundred and sixty-one
Ordinalfourteen thousand, one hundred and sixty-first
Scientific notation1.4161 × 10^4
Engineering notation14.161 × 10^3

Nearest landmarks

Next prime14,173+12
Previous prime14,159−2
Distance to nearest prime2
Nearest square below14,161
Nearest square above14,400

Powers & multiples

14,161 to the power 2200,533,921
14,161 to the power 32,839,760,855,281
14,161 to the power 440,213,853,471,634,241
14,161 to the power 5569,468,379,011,812,486,801
First ten multiples14,161, 28,322, 42,483, 56,644, 70,805, 84,966, 99,127, 113,288, 127,449, 141,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 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached42,4843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps14,161 → 42,484 → 21,242 → 10,621 → 31,864 → 15,932 → 7,966 → 3,983 → 11,950 → 5,975 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,416,100%
14,161% as a decimal141.61
14,161% of 10014,161
14,161% of 1,000141,610
As a fraction of 10014,161/100

Read another way

As bytes13.829 KiB
As a 24-bit colour#003751

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