Nerdulator> put something in

Recognised as Number

13,917

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,917
Digit count5
Digit sum21
Digit product189
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 4,639
Distinct prime factors23, 4,639
Number of divisors4
Sum of divisors σ(n)18,560
Aliquot sum4,643sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,276integers below n that share no factor with it
Carmichael function λ(n)4,638the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,276
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 4,639, 13,9174 in total

Arithmetic

Previous number13,916
Next number13,918
Double27,834
Square root117.970335254≈irrational, shown to 9 decimal places
Cube root24.053699205≈
Negation-13,917
Reciprocal0.0000718546≈

Representations

Decimal13,917
Binary1101100101110114 bits
Octal33135
Hexadecimal365D
Base 36AQL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, nine hundred and seventeen
Ordinalthirteen thousand, nine hundred and seventeenth
Scientific notation1.3917 × 10^4
Engineering notation13.917 × 10^3

In other bases

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

Bit-level

0011011001011101
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 5d
Gray code10110101110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011011001011101
32-bit00000000000000000011011001011101
64-bit0000000000000000000000000000000000000000000000000011011001011101
One's complement1100100110100010at 16 bits, every bit flipped
Bits reversed1011101001101100at 16 bits
Rotated left by 10110110010111010at 16 bits, wrapping
Shifted left by 1110110010111010= 27,834, no wrap
Shifted right by 11101100101110= 6,958, discarding the low bit
These bits as a double6.87591159 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,921+4
Previous prime13,913−4
Distance to nearest prime4
Nearest square below13,689
Nearest square above13,924

Powers & multiples

13,917 to the power 2193,682,889
13,917 to the power 32,695,484,766,213
13,917 to the power 437,513,061,491,386,321
13,917 to the power 5522,069,276,775,623,429,357
First ten multiples13,917, 27,834, 41,751, 55,668, 69,585, 83,502, 97,419, 111,336, 125,253, 139,170
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached41,7523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,917 → 41,752 → 20,876 → 10,438 → 5,219 → 15,658 → 7,829 → 23,488 → 11,744 → 5,872 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,391,700%
13,917% as a decimal139.17
13,917% of 10013,917
13,917% of 1,000139,170
As a fraction of 10013,917/100

Read another way

As bytes13.591 KiB
As a 24-bit colour#00365D

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