Nerdulator> put something in

Number

13,401

  • Positive
  • Odd
  • Composite
  • 5 digits

13,401 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,401
Digit count5
Digit sum9
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 1,489
Distinct prime factors23, 1,489
Number of divisors6
Sum of divisors σ(n)19,370
Aliquot sum5,969sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,928integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 1,489, 4,467, 13,4016 in total

Arithmetic

Previous number13,400
Next number13,402
Double26,802
Square root115.762688289irrational, shown to 9 decimal places
Cube root23.752668214
Negation-13,401
Reciprocal0.0000746213

Representations

Decimal13,401
Binary1101000101100114 bits
Octal32131
Hexadecimal3459
Base 36AC9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, four hundred and one
Ordinalthirteen thousand, four hundred and first
Scientific notation1.3401 × 10^4
Engineering notation13.401 × 10^3

Nearest landmarks

Next prime13,411+10
Previous prime13,399−2
Distance to nearest prime2
Nearest square below13,225
Nearest square above13,456

Powers & multiples

13,401 to the power 2179,586,801
13,401 to the power 32,406,642,720,201
13,401 to the power 432,251,419,093,413,601
13,401 to the power 5432,201,267,270,835,667,001
First ten multiples13,401, 26,802, 40,203, 53,604, 67,005, 80,406, 93,807, 107,208, 120,609, 134,010
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time
Highest value reached45,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,401 → 40,204 → 20,102 → 10,051 → 30,154 → 15,077 → 45,232 → 22,616 → 11,308 → 5,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,340,100%
13,401% as a decimal134.01
13,401% of 10013,401
13,401% of 1,000134,010
As a fraction of 10013,401/100

Read another way

As bytes13.087 KiB
As a 24-bit colour#003459

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