Recognised as Number

13,669

Positive
Odd
Prime
5 digits

13,669 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value13,669

Digit count5

Digit sum25

Digit product972

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13,669

Distinct prime factors113,669

Number of divisors2

Sum of divisors σ(n)13,670

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)13,668integers below n that share no factor with it

Carmichael function λ(n)13,668the 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,6692 in total

Arithmetic

Previous number13,668

Next number13,670

Double27,338

Half6,834.5

Square186,841,561

Cube2,553,937,297,309

Square root116.914498673≈irrational, shown to 9 decimal places

Cube root23.909963575≈

Negation-13,669

Reciprocal0.0000731582≈

Representations

Decimal13,669

Binary1101010110010114 bits

Octal32545

Hexadecimal3565

Base 36AJP

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirteen thousand, six hundred and sixty-nine

Ordinalthirteen thousand, six hundred and sixty-ninth

Scientific notation1.3669 × 10^4

Engineering notation13.669 × 10^3

In other bases

Ternary200202021base 3; the most digit-efficient integer base after e: 9 digits

Quinary414134base 5; one hand: 6 digits

Septenary54565base 7: 5 digits

Nonary20667base 9; each digit is two ternary digits: 5 digits

Duodecimal7ab1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1e39base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:47:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T01T1T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100101010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010101100101

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 65

Gray code10111111010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010101100101

32-bit00000000000000000011010101100101

64-bit0000000000000000000000000000000000000000000000000011010101100101

One's complement1100101010011010at 16 bits, every bit flipped

Bits reversed1010011010101100at 16 bits

Rotated left by 10110101011001010at 16 bits, wrapping

Shifted left by 1110101011001010= 27,338, no wrap

Shifted right by 11101010110010= 6,834, discarding the low bit

These bits as a double6.75338331 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,679+10

Previous prime13,649−20

Distance to nearest prime0, it is prime

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,669 to the power 2186,841,561

13,669 to the power 32,553,937,297,309

13,669 to the power 434,909,768,916,916,721

13,669 to the power 5477,181,631,325,334,659,349

First ten multiples13,669, 27,338, 41,007, 54,676, 68,345, 82,014, 95,683, 109,352, 123,021, 136,690

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached41,0083× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps13,669 → 41,008 → 20,504 → 10,252 → 5,126 → 2,563 → 7,690 → 3,845 → 11,536 → 5,768 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,366,900%

13,669% as a decimal136.69

13,669% of 10013,669

13,669% of 1,000136,690

As a fraction of 10013,669/100

Read another way

As seconds3 hours, 47 minutes and 49 seconds

As bytes13.349 KiB

As a 24-bit colour#003565

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.