Recognised as Number

13,451

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value13,451

Digit count5

Digit sum14

Digit product60

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13,451

Distinct prime factors113,451

Number of divisors2

Sum of divisors σ(n)13,452

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)13,450integers below n that share no factor with it

Carmichael function λ(n)13,450the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 13,4512 in total

Arithmetic

Previous number13,450

Next number13,452

Double26,902

Half6,725.5

Square180,929,401

Cube2,433,681,372,851

Square root115.978446273≈irrational, shown to 9 decimal places

Cube root23.782172465≈

Negation-13,451

Reciprocal0.0000743439≈

Representations

Decimal13,451

Binary1101001000101114 bits

Octal32213

Hexadecimal348B

Base 36ADN

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirteen thousand, four hundred and fifty-one

Ordinalthirteen thousand, four hundred and fifty-first

Scientific notation1.3451 × 10^4

Engineering notation13.451 × 10^3

In other bases

Ternary200110012base 3; the most digit-efficient integer base after e: 9 digits

Quinary412301base 5; one hand: 6 digits

Septenary54134base 7: 5 digits

Nonary20405base 9; each digit is two ternary digits: 5 digits

Duodecimal794bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1dcbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:44:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T001101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111010110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010010001011

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

Bytes234 8b

Gray code10111011001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010010001011

32-bit00000000000000000011010010001011

64-bit0000000000000000000000000000000000000000000000000011010010001011

One's complement1100101101110100at 16 bits, every bit flipped

Bits reversed1101000100101100at 16 bits

Rotated left by 10110100100010110at 16 bits, wrapping

Shifted left by 1110100100010110= 26,902, no wrap

Shifted right by 11101001000101= 6,725, discarding the low bit

These bits as a double6.645677 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,457+6

Previous prime13,441−10

Distance to nearest prime0, it is prime

Nearest square below13,225

Nearest square above13,456

Powers & multiples

13,451 to the power 2180,929,401

13,451 to the power 32,433,681,372,851

13,451 to the power 432,735,448,146,218,801

13,451 to the power 5440,324,513,014,789,092,251

First ten multiples13,451, 26,902, 40,353, 53,804, 67,255, 80,706, 94,157, 107,608, 121,059, 134,510

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached60,5324× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps13,451 → 40,354 → 20,177 → 60,532 → 30,266 → 15,133 → 45,400 → 22,700 → 11,350 → 5,675 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,345,100%

13,451% as a decimal134.51

13,451% of 10013,451

13,451% of 1,000134,510

As a fraction of 10013,451/100

Read another way

As seconds3 hours, 44 minutes and 11 seconds

As bytes13.136 KiB

As a 24-bit colour#00348B

Keep nerding

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