Recognised as Number

58,115

Positive
Odd
Composite
5 digits

58,115 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value58,115

Digit count5

Digit sum20

Digit product200

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 59 × 197

Distinct prime factors35, 59, 197

Number of divisors8

Sum of divisors σ(n)71,280

Aliquot sum13,165sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,684the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 45,472

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 59, 197, 295, 985, 11,623, 58,1158 in total

Arithmetic

Previous number58,114

Next number58,116

Double116,230

Half29,057.5

Square3,377,353,225

Cube196,274,882,670,875

Square root241.070529099≈irrational, shown to 9 decimal places

Cube root38.734332896≈

Negation-58,115

Reciprocal0.0000172073≈

Representations

Decimal58,115

Binary111000110000001116 bits

Octal161403

HexadecimalE303

Base 3618UB

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

In wordsfifty-eight thousand, one hundred and fifteen

Ordinalfifty-eight thousand, one hundred and fifteenth

Scientific notation5.8115 × 10^4

Engineering notation58.115 × 10^3

In other bases

Ternary2221201102base 3; the most digit-efficient integer base after e: 10 digits

Quinary3324430base 5; one hand: 7 digits

Septenary331301base 7: 6 digits

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

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

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

Sexagesimal16:8:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110001100000011

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2e3 03

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

At each machine width

16-bit1110001100000011

32-bit00000000000000001110001100000011

64-bit0000000000000000000000000000000000000000000000001110001100000011

One's complement0001110011111100at 16 bits, every bit flipped

Bits reversed1100000011000111at 16 bits

Rotated left by 11100011000000111at 16 bits, wrapping

Shifted left by 111100011000000110= 116,230, no wrap

Shifted right by 1111000110000001= 29,057, discarding the low bit

These bits as a double2.8712625 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime58,129+14

Previous prime58,111−4

Distance to nearest prime4

Nearest square below58,081

Nearest square above58,564

Powers & multiples

58,115 to the power 23,377,353,225

58,115 to the power 3196,274,882,670,875

58,115 to the power 411,406,514,806,417,900,625

58,115 to the power 5662,889,607,974,976,294,821,875

First ten multiples58,115, 116,230, 174,345, 232,460, 290,575, 348,690, 406,805, 464,920, 523,035, 581,150

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached261,5204× the starting value

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

First steps58,115 → 174,346 → 87,173 → 261,520 → 130,760 → 65,380 → 32,690 → 16,345 → 49,036 → 24,518 → …

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

As a percentage & fraction

As a percentage5,811,500%

58,115% as a decimal581.15

58,115% of 10058,115

58,115% of 1,000581,150

As a fraction of 10058,115/100

Read another way

As seconds16 hours, 8 minutes and 35 seconds

As bytes56.753 KiB

As a 24-bit colour#00E303

Keep nerding

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