Nerdulator> put something in

Recognised as Number

59,446

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,446
Digit count5
Digit sum28
Digit product4,320
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 factorisation2 × 29,723
Distinct prime factors22, 29,723
Number of divisors4
Sum of divisors σ(n)89,172
Aliquot sum29,726sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,722integers below n that share no factor with it
Carmichael function λ(n)29,722the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 29,723, 59,4464 in total

Arithmetic

Previous number59,445
Next number59,447
Double118,892
Half29,723
Square root243.815504019≈irrational, shown to 9 decimal places
Cube root39.027812727≈
Negation-59,446
Reciprocal0.000016822≈

Representations

Decimal59,446
Binary111010000011011016 bits
Octal164066
HexadecimalE836
Base 3619VA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and forty-six
Ordinalfifty-nine thousand, four hundred and forty-sixth
Scientific notation5.9446 × 10^4
Engineering notation59.446 × 10^3

In other bases

Ternary10000112201base 3; the most digit-efficient integer base after e: 11 digits
Quinary3400241base 5; one hand: 7 digits
Septenary335212base 7: 6 digits
Nonary100481base 9; each digit is two ternary digits: 6 digits
Duodecimal2a49abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal78c6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:30:46base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001TT0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110100000110110
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 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
Bytes2e8 36
Gray code1001110000101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100000110110
32-bit00000000000000001110100000110110
64-bit0000000000000000000000000000000000000000000000001110100000110110
One's complement0001011111001001at 16 bits, every bit flipped
Bits reversed0110110000010111at 16 bits
Rotated left by 11101000001101101at 16 bits, wrapping
Shifted left by 111101000001101100= 118,892, no wrap
Shifted right by 1111010000011011= 29,723, discarding the low bit
These bits as a double2.93702264 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,447+1
Previous prime59,443−3
Distance to nearest prime1
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,446 to the power 23,533,826,916
59,446 to the power 3210,071,874,848,536
59,446 to the power 412,487,932,672,246,071,056
59,446 to the power 5742,357,645,634,339,939,994,976
First ten multiples59,446, 118,892, 178,338, 237,784, 297,230, 356,676, 416,122, 475,568, 535,014, 594,460
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time
Highest value reached857,03214× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,446 → 29,723 → 89,170 → 44,585 → 133,756 → 66,878 → 33,439 → 100,318 → 50,159 → 150,478 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,944,600%
59,446% as a decimal594.46
59,446% of 10059,446
59,446% of 1,000594,460
As a fraction of 10059,446/100

Read another way

As bytes58.053 KiB
As a 24-bit colour#00E836

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