Nerdulator> put something in

Number

55,031

  • Positive
  • Odd
  • Composite
  • 5 digits

55,031 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 value55,031
Digit count5
Digit sum14
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation113 × 487
Distinct prime factors2113, 487
Number of divisors4
Sum of divisors σ(n)55,632
Aliquot sum601sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)54,432integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 113, 487, 55,0314 in total

Arithmetic

Previous number55,030
Next number55,032
Double110,062
Square root234.586870903irrational, shown to 9 decimal places
Cube root38.036668207
Negation-55,031
Reciprocal0.0000181716

Representations

Decimal55,031
Binary110101101111011116 bits
Octal153367
HexadecimalD6F7
Base 3616GN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand and thirty-one
Ordinalfifty-five thousand and thirty-first
Scientific notation5.5031 × 10^4
Engineering notation55.031 × 10^3

Nearest landmarks

Next prime55,049+18
Previous prime55,021−10
Distance to nearest prime10
Nearest square below54,756
Nearest square above55,225

Powers & multiples

55,031 to the power 23,028,410,961
55,031 to the power 3166,656,483,594,791
55,031 to the power 49,171,272,948,704,943,521
55,031 to the power 5504,704,321,640,181,746,904,151
First ten multiples55,031, 110,062, 165,093, 220,124, 275,155, 330,186, 385,217, 440,248, 495,279, 550,310
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time
Highest value reached371,4646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,031 → 165,094 → 82,547 → 247,642 → 123,821 → 371,464 → 185,732 → 92,866 → 46,433 → 139,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,503,100%
55,031% as a decimal550.31
55,031% of 10055,031
55,031% of 1,000550,310
As a fraction of 10055,031/100

Read another way

As bytes53.741 KiB
As a 24-bit colour#00D6F7

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