Recognised as Number

14,152

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value14,152

Digit count5

Digit sum13

Digit product40

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 29 × 61

Distinct prime factors32, 29, 61

Number of divisors16

Sum of divisors σ(n)27,900

Aliquot sum13,748sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,720

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 29, 58, 61, 116, 122, 232, 244, 488, 1,769, 3,538, 7,076, 14,15216 in total

Arithmetic

Previous number14,151

Next number14,153

Double28,304

Half7,076

Square200,279,104

Cube2,834,349,879,808

Square root118.962178864≈irrational, shown to 9 decimal places

Cube root24.18833306≈

Negation-14,152

Reciprocal0.0000706614≈

Representations

Decimal14,152

Binary1101110100100014 bits

Octal33510

Hexadecimal3748

Base 36AX4

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

In wordsfourteen thousand, one hundred and fifty-two

Ordinalfourteen thousand, one hundred and fifty-second

Scientific notation1.4152 × 10^4

Engineering notation14.152 × 10^3

In other bases

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

Quinary423102base 5; one hand: 6 digits

Septenary56155base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011011101001000

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 13worth 8,192

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes237 48

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

At each machine width

16-bit0011011101001000

32-bit00000000000000000011011101001000

64-bit0000000000000000000000000000000000000000000000000011011101001000

One's complement1100100010110111at 16 bits, every bit flipped

Bits reversed0001001011101100at 16 bits

Rotated left by 10110111010010000at 16 bits, wrapping

Shifted left by 1110111010010000= 28,304, no wrap

Shifted right by 11101110100100= 7,076, discarding the low bit

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

Nearest landmarks

Next prime14,153+1

Previous prime14,149−3

Distance to nearest prime1

Nearest square below13,924

Nearest square above14,161

Powers & multiples

14,152 to the power 2200,279,104

14,152 to the power 32,834,349,879,808

14,152 to the power 440,111,719,499,042,816

14,152 to the power 5567,661,054,350,453,932,032

First ten multiples14,152, 28,304, 42,456, 56,608, 70,760, 84,912, 99,064, 113,216, 127,368, 141,520

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 4

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached14,152

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

First steps14,152 → 7,076 → 3,538 → 1,769 → 5,308 → 2,654 → 1,327 → 3,982 → 1,991 → 5,974 → …

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

As a percentage & fraction

As a percentage1,415,200%

14,152% as a decimal141.52

14,152% of 10014,152

14,152% of 1,000141,520

As a fraction of 10014,152/100

Read another way

As seconds3 hours, 55 minutes and 52 seconds

As bytes13.82 KiB

As a 24-bit colour#003748

Keep nerding

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