Nerdulator> put something in

Recognised as Number

13,915

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,915
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 factorisation5 × 11^2 × 23
Distinct prime factors35, 11, 23
Number of divisors12
Sum of divisors σ(n)19,152
Aliquot sum5,237sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,680integers below n that share no factor with it
Carmichael function λ(n)220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,680
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 11, 23, 55, 115, 121, 253, 605, 1,265, 2,783, 13,91512 in total

Arithmetic

Previous number13,914
Next number13,916
Double27,830
Square root117.961858242≈irrational, shown to 9 decimal places
Cube root24.052546904≈
Negation-13,915
Reciprocal0.0000718649≈

Representations

Decimal13,915
Binary1101100101101114 bits
Octal33133
Hexadecimal365B
Base 36AQJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, nine hundred and fifteen
Ordinalthirteen thousand, nine hundred and fifteenth
Scientific notation1.3915 × 10^4
Engineering notation13.915 × 10^3

In other bases

Ternary201002101base 3; the most digit-efficient integer base after e: 9 digits
Quinary421130base 5; one hand: 6 digits
Septenary55366base 7: 5 digits
Nonary21071base 9; each digit is two ternary digits: 5 digits
Duodecimal8077base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1effbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:51:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0101T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011011001011011
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
Bytes236 5b
Gray code10110101110110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011011001011011
32-bit00000000000000000011011001011011
64-bit0000000000000000000000000000000000000000000000000011011001011011
One's complement1100100110100100at 16 bits, every bit flipped
Bits reversed1101101001101100at 16 bits
Rotated left by 10110110010110110at 16 bits, wrapping
Shifted left by 1110110010110110= 27,830, no wrap
Shifted right by 11101100101101= 6,957, discarding the low bit
These bits as a double6.87492346 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,921+6
Previous prime13,913−2
Distance to nearest prime2
Nearest square below13,689
Nearest square above13,924

Powers & multiples

13,915 to the power 2193,627,225
13,915 to the power 32,694,322,835,875
13,915 to the power 437,491,502,261,200,625
13,915 to the power 5521,694,253,964,606,696,875
First ten multiples13,915, 27,830, 41,745, 55,660, 69,575, 83,490, 97,405, 111,320, 125,235, 139,150
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached118,8888× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,915 → 41,746 → 20,873 → 62,620 → 31,310 → 15,655 → 46,966 → 23,483 → 70,450 → 35,225 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,391,500%
13,915% as a decimal139.15
13,915% of 10013,915
13,915% of 1,000139,150
As a fraction of 10013,915/100

Read another way

As bytes13.589 KiB
As a 24-bit colour#00365B

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