Nerdulator> put something in

Recognised as Number

13,613

  • Positive
  • Odd
  • Prime
  • 5 digits

13,613 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,613
Digit count5
Digit sum14
Digit product54
Multiplicative persistence3times 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,613
Distinct prime factors113,613
Number of divisors2
Sum of divisors σ(n)13,614
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)13,612integers below n that share no factor with it
Carmichael function λ(n)13,612the 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,6132 in total

Arithmetic

Previous number13,612
Next number13,614
Double27,226
Square root116.674761624≈irrational, shown to 9 decimal places
Cube root23.877266947≈
Negation-13,613
Reciprocal0.0000734592≈

Representations

Decimal13,613
Binary1101010010110114 bits
Octal32455
Hexadecimal352D
Base 36AI5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, six hundred and thirteen
Ordinalthirteen thousand, six hundred and thirteenth
Scientific notation1.3613 × 10^4
Engineering notation13.613 × 10^3

In other bases

Ternary200200012base 3; the most digit-efficient integer base after e: 9 digits
Quinary413423base 5; one hand: 6 digits
Septenary54455base 7: 5 digits
Nonary20605base 9; each digit is two ternary digits: 5 digits
Duodecimal7a65base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1e0dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:46:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01T001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010100101101
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes235 2d
Gray code10111110111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010100101101
32-bit00000000000000000011010100101101
64-bit0000000000000000000000000000000000000000000000000011010100101101
One's complement1100101011010010at 16 bits, every bit flipped
Bits reversed1011010010101100at 16 bits
Rotated left by 10110101001011010at 16 bits, wrapping
Shifted left by 1110101001011010= 27,226, no wrap
Shifted right by 11101010010110= 6,806, discarding the low bit
These bits as a double6.72571564 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,619+6
Previous prime13,597−16
Distance to nearest prime0, it is prime
Nearest square below13,456
Nearest square above13,689

Powers & multiples

13,613 to the power 2185,313,769
13,613 to the power 32,522,676,337,397
13,613 to the power 434,341,192,980,985,361
13,613 to the power 5467,486,660,050,153,719,293
First ten multiples13,613, 27,226, 40,839, 54,452, 68,065, 81,678, 95,291, 108,904, 122,517, 136,130
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time
Highest value reached40,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,613 → 40,840 → 20,420 → 10,210 → 5,105 → 15,316 → 7,658 → 3,829 → 11,488 → 5,744 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,361,300%
13,613% as a decimal136.13
13,613% of 10013,613
13,613% of 1,000136,130
As a fraction of 10013,613/100

Read another way

As bytes13.294 KiB
As a 24-bit colour#00352D

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