Nerdulator> put something in

Recognised as Number

13,519

  • Positive
  • Odd
  • Composite
  • 5 digits

13,519 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,519
Digit count5
Digit sum19
Digit product135
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 1,229
Distinct prime factors211, 1,229
Number of divisors4
Sum of divisors σ(n)14,760
Aliquot sum1,241sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,280integers below n that share no factor with it
Carmichael function λ(n)6,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,280
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 1,229, 13,5194 in total

Arithmetic

Previous number13,518
Next number13,520
Double27,038
Square root116.27123462≈irrational, shown to 9 decimal places
Cube root23.822181143≈
Negation-13,519
Reciprocal0.00007397≈

Representations

Decimal13,519
Binary1101001100111114 bits
Octal32317
Hexadecimal34CF
Base 36AFJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, five hundred and nineteen
Ordinalthirteen thousand, five hundred and nineteenth
Scientific notation1.3519 × 10^4
Engineering notation13.519 × 10^3

In other bases

Ternary200112201base 3; the most digit-efficient integer base after e: 9 digits
Quinary413034base 5; one hand: 6 digits
Septenary54262base 7: 5 digits
Nonary20481base 9; each digit is two ternary digits: 5 digits
Duodecimal79a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1dfjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:45:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01TT0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010111010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010011001111
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 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 cf
Gray code10111010101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010011001111
32-bit00000000000000000011010011001111
64-bit0000000000000000000000000000000000000000000000000011010011001111
One's complement1100101100110000at 16 bits, every bit flipped
Bits reversed1111001100101100at 16 bits
Rotated left by 10110100110011110at 16 bits, wrapping
Shifted left by 1110100110011110= 27,038, no wrap
Shifted right by 11101001100111= 6,759, discarding the low bit
These bits as a double6.67927347 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,523+4
Previous prime13,513−6
Distance to nearest prime4
Nearest square below13,456
Nearest square above13,689

Powers & multiples

13,519 to the power 2182,763,361
13,519 to the power 32,470,777,877,359
13,519 to the power 433,402,446,124,016,321
13,519 to the power 5451,567,669,150,576,643,599
First ten multiples13,519, 27,038, 40,557, 54,076, 67,595, 81,114, 94,633, 108,152, 121,671, 135,190
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 19

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time
Highest value reached136,88810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,519 → 40,558 → 20,279 → 60,838 → 30,419 → 91,258 → 45,629 → 136,888 → 68,444 → 34,222 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,351,900%
13,519% as a decimal135.19
13,519% of 10013,519
13,519% of 1,000135,190
As a fraction of 10013,519/100

Read another way

As bytes13.202 KiB
As a 24-bit colour#0034CF

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