Number

14,637

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value14,637

Digit count5

Digit sum21

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 17 × 41

Distinct prime factors43, 7, 17, 41

Number of divisors16

Sum of divisors σ(n)24,192

Aliquot sum9,555sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 17, 21, 41, 51, 119, 123, 287, 357, 697, 861, 2,091, 4,879, 14,63716 in total

Arithmetic

Previous number14,636

Next number14,638

Double29,274

Half7,318.5

Square214,241,769

Cube3,135,856,772,853

Square root120.983469945≈irrational, shown to 9 decimal places

Cube root24.461552914≈

Negation-14,637

Reciprocal0.00006832≈

Representations

Decimal14,637

Binary1110010010110114 bits

Octal34455

Hexadecimal392D

Base 36BAL

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

In wordsfourteen thousand, six hundred and thirty-seven

Ordinalfourteen thousand, six hundred and thirty-seventh

Scientific notation1.4637 × 10^4

Engineering notation14.637 × 10^3

Nearest landmarks

Next prime14,639+2

Previous prime14,633−4

Distance to nearest prime2

Nearest square below14,400

Nearest square above14,641

Powers & multiples

14,637 to the power 2214,241,769

14,637 to the power 33,135,856,772,853

14,637 to the power 445,899,535,584,249,361

14,637 to the power 5671,831,502,346,657,896,957

First ten multiples14,637, 29,274, 43,911, 58,548, 73,185, 87,822, 102,459, 117,096, 131,733, 146,370

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time

Highest value reached43,9123× the starting value

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

First steps14,637 → 43,912 → 21,956 → 10,978 → 5,489 → 16,468 → 8,234 → 4,117 → 12,352 → 6,176 → …

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

As a percentage & fraction

As a percentage1,463,700%

14,637% as a decimal146.37

14,637% of 10014,637

14,637% of 1,000146,370

As a fraction of 10014,637/100

Read another way

As seconds4 hours, 3 minutes and 57 seconds

As bytes14.294 KiB

As a 24-bit colour#00392D

Keep nerding

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