Nerdulator> put something in

Recognised as Number

14,292

  • Positive
  • Even
  • Composite
  • 5 digits

14,292 is an even 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value14,292
Digit count5
Digit sum18
Digit product144
Multiplicative persistence3times 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^2 × 3^2 × 397
Distinct prime factors32, 3, 397
Number of divisors18
Sum of divisors σ(n)36,218
Aliquot sum21,926sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)4,752integers below n that share no factor with it
Carmichael function λ(n)396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,752
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 9, 12, 18, 36, 397, 794, 1,191, 1,588, 2,382, 3,573, 4,764, 7,146, 14,29218 in total

Arithmetic

Previous number14,291
Next number14,293
Double28,584
Half7,146
Square root119.549153071≈irrational, shown to 9 decimal places
Cube root24.267833271≈
Negation-14,292
Reciprocal0.0000699692≈

Representations

Decimal14,292
Binary1101111101010014 bits
Octal33724
Hexadecimal37D4
Base 36B10
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfourteen thousand, two hundred and ninety-two
Ordinalfourteen thousand, two hundred and ninety-second
Scientific notation1.4292 × 10^4
Engineering notation14.292 × 10^3

In other bases

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

Bit-level

0011011111010100
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes237 d4
Gray code10110000111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011011111010100
32-bit00000000000000000011011111010100
64-bit0000000000000000000000000000000000000000000000000011011111010100
One's complement1100100000101011at 16 bits, every bit flipped
Bits reversed0010101111101100at 16 bits
Rotated left by 10110111110101000at 16 bits, wrapping
Shifted left by 1110111110101000= 28,584, no wrap
Shifted right by 11101111101010= 7,146, discarding the low bit
These bits as a double7.06118621 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime14,293+1
Previous prime14,281−11
Distance to nearest prime1
Nearest square below14,161
Nearest square above14,400

Powers & multiples

14,292 to the power 2204,261,264
14,292 to the power 32,919,301,985,088
14,292 to the power 441,722,663,970,877,696
14,292 to the power 5596,300,313,471,784,031,232
First ten multiples14,292, 28,584, 42,876, 57,168, 71,460, 85,752, 100,044, 114,336, 128,628, 142,920
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 176the total stopping time
Highest value reached14,292
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps14,292 → 7,146 → 3,573 → 10,720 → 5,360 → 2,680 → 1,340 → 670 → 335 → 1,006 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,429,200%
14,292% as a decimal142.92
14,292% of 10014,292
14,292% of 1,000142,920
As a fraction of 10014,292/100

Read another way

As bytes13.957 KiB
As a 24-bit colour#0037D4

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