Recognised as Number
59,696
- Positive
- Even
- Composite
- 5 digits
59,696 is an even 5-digit integer and a composite number. It has 40 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,696
Digit count5
Digit sum35
Digit product14,580
Multiplicative persistence2times 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^4 × 7 × 13 × 41
Distinct prime factors42, 7, 13, 41
Number of divisors40
Sum of divisors σ(n)145,824
Aliquot sum86,128sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)23,040integers below n that share no factor with it
Carmichael function λ(n)120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 41, 52, 56, 82, 91, 104, 112, 164, 182, 208, 287, 328, 364, 533, 574, 656, 728, 1,066, 1,148, 1,456, 2,132, 2,296, 3,731, 4,264, 4,592, 7,462, 8,528, 14,924, 29,848, 59,69640 in total
Arithmetic
Representations
Decimal59,696
Binary111010010011000016 bits
Octal164460
HexadecimalE930
Base 361A28
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, six hundred and ninety-six
Ordinalfifty-nine thousand, six hundred and ninety-sixth
Scientific notation5.9696 × 10^4
Engineering notation59.696 × 10^3
In other bases
Ternary10000212222base 3; the most digit-efficient integer base after e: 11 digits
Quinary3402241base 5; one hand: 7 digits
Septenary336020base 7: 6 digits
Nonary100788base 9; each digit is two ternary digits: 6 digits
Duodecimal2a668base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal794gbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:34:56base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100010T000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100101110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100100110000
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes2e9 30
Gray code1001110110101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100100110000
32-bit00000000000000001110100100110000
64-bit0000000000000000000000000000000000000000000000001110100100110000
One's complement0001011011001111at 16 bits, every bit flipped
Bits reversed0000110010010111at 16 bits
Rotated left by 11101001001100001at 16 bits, wrapping
Shifted left by 111101001001100000= 119,392, no wrap
Shifted right by 1111010010011000= 29,848, discarding the low bit
These bits as a double2.94937428 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
59,696 to the power 23,563,612,416
59,696 to the power 3212,733,406,785,536
59,696 to the power 412,699,333,451,469,357,056
59,696 to the power 5758,099,409,718,914,738,814,976
First ten multiples59,696, 119,392, 179,088, 238,784, 298,480, 358,176, 417,872, 477,568, 537,264, 596,960
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 96
Collatz (3n + 1) trajectory
Steps to reach 173the total stopping time
Highest value reached59,696
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,696 → 29,848 → 14,924 → 7,462 → 3,731 → 11,194 → 5,597 → 16,792 → 8,396 → 4,198 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,969,600%
59,696% as a decimal596.96
59,696% of 10059,696
59,696% of 1,000596,960
As a fraction of 10059,696/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 59,696
Nerdulate something else
Nothing in mind? Surprise me · today’s page