Nerdulator> put something in

Recognised as Number

59,066

  • Positive
  • Even
  • Composite
  • 5 digits

59,066 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,066
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 4,219
Distinct prime factors32, 7, 4,219
Number of divisors8
Sum of divisors σ(n)101,280
Aliquot sum42,214sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)25,308integers below n that share no factor with it
Carmichael function λ(n)4,218the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,308
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 4,219, 8,438, 29,533, 59,0668 in total

Arithmetic

Previous number59,065
Next number59,067
Double118,132
Half29,533
Square root243.034976907≈irrational, shown to 9 decimal places
Cube root38.944475007≈
Negation-59,066
Reciprocal0.0000169302≈

Representations

Decimal59,066
Binary111001101011101016 bits
Octal163272
HexadecimalE6BA
Base 3619KQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand and sixty-six
Ordinalfifty-nine thousand and sixty-sixth
Scientific notation5.9066 × 10^4
Engineering notation59.066 × 10^3

In other bases

Ternary10000000122base 3; the most digit-efficient integer base after e: 11 digits
Quinary3342231base 5; one hand: 7 digits
Septenary334130base 7: 6 digits
Nonary100018base 9; each digit is two ternary digits: 6 digits
Duodecimal2a222base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal77d6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:24:26base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10000001T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101111001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110011010111010
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2e6 ba
Gray code1001010111100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110011010111010
32-bit00000000000000001110011010111010
64-bit0000000000000000000000000000000000000000000000001110011010111010
One's complement0001100101000101at 16 bits, every bit flipped
Bits reversed0101110101100111at 16 bits
Rotated left by 11100110101110101at 16 bits, wrapping
Shifted left by 111100110101110100= 118,132, no wrap
Shifted right by 1111001101011101= 29,533, discarding the low bit
These bits as a double2.91824814 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,069+3
Previous prime59,063−3
Distance to nearest prime3
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,066 to the power 23,488,792,356
59,066 to the power 3206,069,009,299,496
59,066 to the power 412,171,672,103,284,030,736
59,066 to the power 5718,931,984,452,574,559,452,576
First ten multiples59,066, 118,132, 177,198, 236,264, 295,330, 354,396, 413,462, 472,528, 531,594, 590,660
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time
Highest value reached88,6001× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,066 → 29,533 → 88,600 → 44,300 → 22,150 → 11,075 → 33,226 → 16,613 → 49,840 → 24,920 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,906,600%
59,066% as a decimal590.66
59,066% of 10059,066
59,066% of 1,000590,660
As a fraction of 10059,066/100

Read another way

As bytes57.682 KiB
As a 24-bit colour#00E6BA

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