Number

55,503

Positive
Odd
Composite
5 digits

55,503 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,503

Digit count5

Digit sum18

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 881

Distinct prime factors33, 7, 881

Number of divisors12

Sum of divisors σ(n)91,728

Aliquot sum36,225sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 63, 881, 2,643, 6,167, 7,929, 18,501, 55,50312 in total

Arithmetic

Previous number55,502

Next number55,504

Double111,006

Half27,751.5

Square3,080,583,009

Cube170,981,598,748,527

Square root235.590746847≈irrational, shown to 9 decimal places

Cube root38.145105404≈

Negation-55,503

Reciprocal0.000018017≈

Representations

Decimal55,503

Binary110110001100111116 bits

Octal154317

HexadecimalD8CF

Base 3616TR

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

In wordsfifty-five thousand, five hundred and three

Ordinalfifty-five thousand, five hundred and third

Scientific notation5.5503 × 10^4

Engineering notation55.503 × 10^3

Nearest landmarks

Next prime55,511+8

Previous prime55,501−2

Distance to nearest prime2

Nearest square below55,225

Nearest square above55,696

Powers & multiples

55,503 to the power 23,080,583,009

55,503 to the power 3170,981,598,748,527

55,503 to the power 49,489,991,675,339,494,081

55,503 to the power 5526,723,007,956,367,939,977,743

First ten multiples55,503, 111,006, 166,509, 222,012, 277,515, 333,018, 388,521, 444,024, 499,527, 555,030

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 3

Collatz (3n + 1) trajectory

Steps to reach 1140the total stopping time

Highest value reached1,200,25621× the starting value

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

First steps55,503 → 166,510 → 83,255 → 249,766 → 124,883 → 374,650 → 187,325 → 561,976 → 280,988 → 140,494 → …

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

As a percentage & fraction

As a percentage5,550,300%

55,503% as a decimal555.03

55,503% of 10055,503

55,503% of 1,000555,030

As a fraction of 10055,503/100

Read another way

As seconds15 hours, 25 minutes and 3 seconds

As bytes54.202 KiB

As a 24-bit colour#00D8CF

Keep nerding

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