Nerdulator> put something in

Recognised as Number

14,693

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value14,693
Digit count5
Digit sum23
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 2,099
Distinct prime factors27, 2,099
Number of divisors4
Sum of divisors σ(n)16,800
Aliquot sum2,107sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,588integers below n that share no factor with it
Carmichael function λ(n)6,294the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,588
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 2,099, 14,6934 in total

Arithmetic

Previous number14,692
Next number14,694
Double29,386
Square root121.214685579≈irrational, shown to 9 decimal places
Cube root24.492709201≈
Negation-14,693
Reciprocal0.0000680596≈

Representations

Decimal14,693
Binary1110010110010114 bits
Octal34545
Hexadecimal3965
Base 36BC5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfourteen thousand, six hundred and ninety-three
Ordinalfourteen thousand, six hundred and ninety-third
Scientific notation1.4693 × 10^4
Engineering notation14.693 × 10^3

In other bases

Ternary202011012base 3; the most digit-efficient integer base after e: 9 digits
Quinary432233base 5; one hand: 6 digits
Septenary60560base 7: 5 digits
Nonary22135base 9; each digit is two ternary digits: 5 digits
Duodecimal8605base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1gedbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:4:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1T0111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100111010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011100101100101
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
Bytes239 65
Gray code10010111010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011100101100101
32-bit00000000000000000011100101100101
64-bit0000000000000000000000000000000000000000000000000011100101100101
One's complement1100011010011010at 16 bits, every bit flipped
Bits reversed1010011010011100at 16 bits
Rotated left by 10111001011001010at 16 bits, wrapping
Shifted left by 1111001011001010= 29,386, no wrap
Shifted right by 11110010110010= 7,346, discarding the low bit
These bits as a double7.25930653 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime14,699+6
Previous prime14,683−10
Distance to nearest prime6
Nearest square below14,641
Nearest square above14,884

Powers & multiples

14,693 to the power 2215,884,249
14,693 to the power 33,171,987,270,557
14,693 to the power 446,606,008,966,294,001
14,693 to the power 5684,782,089,741,757,756,693
First ten multiples14,693, 29,386, 44,079, 58,772, 73,465, 88,158, 102,851, 117,544, 132,237, 146,930
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time
Highest value reached44,0803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps14,693 → 44,080 → 22,040 → 11,020 → 5,510 → 2,755 → 8,266 → 4,133 → 12,400 → 6,200 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,469,300%
14,693% as a decimal146.93
14,693% of 10014,693
14,693% of 1,000146,930
As a fraction of 10014,693/100

Read another way

As bytes14.349 KiB
As a 24-bit colour#003965

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