Nerdulator> put something in

Recognised as Number

58,741

  • Positive
  • Odd
  • Prime
  • 5 digits

58,741 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value58,741
Digit count5
Digit sum25
Digit product1,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation58,741
Distinct prime factors158,741
Number of divisors2
Sum of divisors σ(n)58,742
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58,740integers below n that share no factor with it
Carmichael function λ(n)58,740the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 58,7412 in total

Arithmetic

Previous number58,740
Next number58,742
Double117,482
Square root242.365426577≈irrational, shown to 9 decimal places
Cube root38.872915284≈
Negation-58,741
Reciprocal0.0000170239≈

Representations

Decimal58,741
Binary111001010111010116 bits
Octal162565
HexadecimalE575
Base 3619BP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-eight thousand, seven hundred and forty-one
Ordinalfifty-eight thousand, seven hundred and forty-first
Scientific notation5.8741 × 10^4
Engineering notation58.741 × 10^3

In other bases

Ternary2222120121base 3; the most digit-efficient integer base after e: 10 digits
Quinary3334431base 5; one hand: 7 digits
Septenary333154base 7: 6 digits
Nonary88517base 9; each digit is two ternary digits: 5 digits
Duodecimal29bb1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal76h1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:19:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10000TT1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101010110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110010101110101
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2e5 75
Gray code1001011111001111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110010101110101
32-bit00000000000000001110010101110101
64-bit0000000000000000000000000000000000000000000000001110010101110101
One's complement0001101010001010at 16 bits, every bit flipped
Bits reversed1010111010100111at 16 bits
Rotated left by 11100101011101011at 16 bits, wrapping
Shifted left by 111100101011101010= 117,482, no wrap
Shifted right by 1111001010111010= 29,370, discarding the low bit
These bits as a double2.90219101 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime58,757+16
Previous prime58,733−8
Distance to nearest prime0, it is prime
Nearest square below58,564
Nearest square above59,049

Powers & multiples

58,741 to the power 23,450,505,081
58,741 to the power 3202,686,118,963,021
58,741 to the power 411,905,985,314,006,816,561
58,741 to the power 5699,369,483,330,074,411,609,701
First ten multiples58,741, 117,482, 176,223, 234,964, 293,705, 352,446, 411,187, 469,928, 528,669, 587,410
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 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time
Highest value reached176,2243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps58,741 → 176,224 → 88,112 → 44,056 → 22,028 → 11,014 → 5,507 → 16,522 → 8,261 → 24,784 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,874,100%
58,741% as a decimal587.41
58,741% of 10058,741
58,741% of 1,000587,410
As a fraction of 10058,741/100

Read another way

As bytes57.364 KiB
As a 24-bit colour#00E575

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