Nerdulator> put something in

Recognised as Number

59,495

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value59,495
Digit count5
Digit sum32
Digit product8,100
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicYesreads the same backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 73 × 163
Distinct prime factors35, 73, 163
Number of divisors8
Sum of divisors σ(n)72,816
Aliquot sum13,321sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)46,656integers below n that share no factor with it
Carmichael function λ(n)648the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 46,656
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 73, 163, 365, 815, 11,899, 59,4958 in total

Arithmetic

Previous number59,494
Next number59,496
Double118,990
Square root243.915969137≈irrational, shown to 9 decimal places
Cube root39.038533031≈
Negation-59,495
Reciprocal0.0000168081≈

Representations

Decimal59,495
Binary111010000110011116 bits
Octal164147
HexadecimalE867
Base 3619WN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and ninety-five
Ordinalfifty-nine thousand, four hundred and ninety-fifth
Scientific notation5.9495 × 10^4
Engineering notation59.495 × 10^3

In other bases

Ternary10000121112base 3; the most digit-efficient integer base after e: 11 digits
Quinary3400440base 5; one hand: 7 digits
Septenary335312base 7: 6 digits
Nonary100545base 9; each digit is two ternary digits: 6 digits
Duodecimal2a51bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal78efbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:31:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001T0TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110100001100111
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 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
Bytes2e8 67
Gray code1001110001010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100001100111
32-bit00000000000000001110100001100111
64-bit0000000000000000000000000000000000000000000000001110100001100111
One's complement0001011110011000at 16 bits, every bit flipped
Bits reversed1110011000010111at 16 bits
Rotated left by 11101000011001111at 16 bits, wrapping
Shifted left by 111101000011001110= 118,990, no wrap
Shifted right by 1111010000110011= 29,747, discarding the low bit
These bits as a double2.93944356 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,497+2
Previous prime59,473−22
Distance to nearest prime2
Nearest square below59,049
Nearest square above59,536

Powers & multiples

59,495 to the power 23,539,655,025
59,495 to the power 3210,591,775,712,375
59,495 to the power 412,529,157,696,007,750,625
59,495 to the power 5745,422,237,123,981,123,434,375
First ten multiples59,495, 118,990, 178,485, 237,980, 297,475, 356,970, 416,465, 475,960, 535,455, 594,950
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time
Highest value reached1,373,92023× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,495 → 178,486 → 89,243 → 267,730 → 133,865 → 401,596 → 200,798 → 100,399 → 301,198 → 150,599 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,949,500%
59,495% as a decimal594.95
59,495% of 10059,495
59,495% of 1,000594,950
As a fraction of 10059,495/100

Read another way

As bytes58.101 KiB
As a 24-bit colour#00E867

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