Recognised as Number

58,465

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value58,465

Digit count5

Digit sum28

Digit product4,800

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 11 × 1,063

Distinct prime factors35, 11, 1,063

Number of divisors8

Sum of divisors σ(n)76,608

Aliquot sum18,143sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,480

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 11, 55, 1,063, 5,315, 11,693, 58,4658 in total

Arithmetic

Previous number58,464

Next number58,466

Double116,930

Half29,232.5

Square3,418,156,225

Cube199,842,503,694,625

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

Cube root38.811937022≈

Negation-58,465

Reciprocal0.0000171043≈

Representations

Decimal58,465

Binary111001000110000116 bits

Octal162141

HexadecimalE461

Base 361941

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

In wordsfifty-eight thousand, four hundred and sixty-five

Ordinalfifty-eight thousand, four hundred and sixty-fifth

Scientific notation5.8465 × 10^4

Engineering notation58.465 × 10^3

In other bases

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

Quinary3332330base 5; one hand: 7 digits

Septenary332311base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110010001100001

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

Bytes2e4 61

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

At each machine width

16-bit1110010001100001

32-bit00000000000000001110010001100001

64-bit0000000000000000000000000000000000000000000000001110010001100001

One's complement0001101110011110at 16 bits, every bit flipped

Bits reversed1000011000100111at 16 bits

Rotated left by 11100100011000011at 16 bits, wrapping

Shifted left by 111100100011000010= 116,930, no wrap

Shifted right by 1111001000110000= 29,232, discarding the low bit

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

Nearest landmarks

Next prime58,477+12

Previous prime58,453−12

Distance to nearest prime12

Nearest square below58,081

Nearest square above58,564

Powers & multiples

58,465 to the power 23,418,156,225

58,465 to the power 3199,842,503,694,625

58,465 to the power 411,683,791,978,506,250,625

58,465 to the power 5683,092,898,023,367,942,790,625

First ten multiples58,465, 116,930, 175,395, 233,860, 292,325, 350,790, 409,255, 467,720, 526,185, 584,650

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1197the total stopping time

Highest value reached221,9923× the starting value

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

First steps58,465 → 175,396 → 87,698 → 43,849 → 131,548 → 65,774 → 32,887 → 98,662 → 49,331 → 147,994 → …

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

As a percentage & fraction

As a percentage5,846,500%

58,465% as a decimal584.65

58,465% of 10058,465

58,465% of 1,000584,650

As a fraction of 10058,465/100

Read another way

As seconds16 hours, 14 minutes and 25 seconds

As bytes57.095 KiB

As a 24-bit colour#00E461

Keep nerding

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