Nerdulator> put something in

Recognised as Number

13,914

  • Positive
  • Even
  • Composite
  • 5 digits

13,914 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value13,914
Digit count5
Digit sum18
Digit product108
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 773
Distinct prime factors32, 3, 773
Number of divisors12
Sum of divisors σ(n)30,186
Aliquot sum16,272sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)4,632integers below n that share no factor with it
Carmichael function λ(n)2,316the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,632
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 773, 1,546, 2,319, 4,638, 6,957, 13,91412 in total

Arithmetic

Previous number13,913
Next number13,915
Double27,828
Half6,957
Square root117.957619508≈irrational, shown to 9 decimal places
Cube root24.051970712≈
Negation-13,914
Reciprocal0.0000718701≈

Representations

Decimal13,914
Binary1101100101101014 bits
Octal33132
Hexadecimal365A
Base 36AQI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen thousand, nine hundred and fourteen
Ordinalthirteen thousand, nine hundred and fourteenth
Scientific notation1.3914 × 10^4
Engineering notation13.914 × 10^3

In other bases

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

Bit-level

0011011001011010
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes236 5a
Gray code10110101110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011011001011010
32-bit00000000000000000011011001011010
64-bit0000000000000000000000000000000000000000000000000011011001011010
One's complement1100100110100101at 16 bits, every bit flipped
Bits reversed0101101001101100at 16 bits
Rotated left by 10110110010110100at 16 bits, wrapping
Shifted left by 1110110010110100= 27,828, no wrap
Shifted right by 11101100101101= 6,957, discarding the low bit
These bits as a double6.8744294 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,921+7
Previous prime13,913−1
Distance to nearest prime1
Nearest square below13,689
Nearest square above13,924

Powers & multiples

13,914 to the power 2193,599,396
13,914 to the power 32,693,741,995,944
13,914 to the power 437,480,726,131,564,816
13,914 to the power 5521,506,823,394,592,849,824
First ten multiples13,914, 27,828, 41,742, 55,656, 69,570, 83,484, 97,398, 111,312, 125,226, 139,140
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 4
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 14

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached20,8721× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,914 → 6,957 → 20,872 → 10,436 → 5,218 → 2,609 → 7,828 → 3,914 → 1,957 → 5,872 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,391,400%
13,914% as a decimal139.14
13,914% of 10013,914
13,914% of 1,000139,140
As a fraction of 10013,914/100

Read another way

As bytes13.588 KiB
As a 24-bit colour#00365A

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