Recognised as Number
-69
- Negative
- Odd
- 2 digits
-69 is an odd 2-digit integer and the negative of 69. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value69
Digit count2
Digit sum15
Digit product54
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 23
Distinct prime factors23, 23
Number of divisors4
Sum of divisors σ(n)96
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 694 in total
Arithmetic
Representations
Decimal-69
Binary10001017 bits
Octal105
Hexadecimal45
Base 361X
In wordsminus sixty-nine
Ordinalminus sixty-ninth
Scientific notation-6.9 × 10^1
Engineering notation-69
In other bases
Ternary2120base 3; the most digit-efficient integer base after e: 4 digits
Quinary234base 5; one hand: 3 digits
Septenary126base 7: 3 digits
Nonary76base 9; each digit is two ternary digits: 2 digits
Duodecimal59base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 2 digits
Vigesimal39base 20; hands and feet, and the Mayan and Yoruba systems: 2 digits
Sexagesimal1:9base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
10111011
Bit length7 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits4within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 6worth 64
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes145
Gray code1100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
8-bit10111011two's complement
16-bit1111111110111011two's complement
32-bit11111111111111111111111110111011two's complement
64-bit1111111111111111111111111111111111111111111111111111111110111011two's complement
One's complement01000100at 8 bits, every bit flipped
Bits reversed11011101at 8 bits
Rotated left by 101110111at 8 bits, wrapping
Shifted left by 1-10001010= -138, no wrap
Shifted right by 1-100011= -34, discarding the low bit
These bits as a double3.40905296 × 10^-322≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-69 to the power 24,761
-69 to the power 3-328,509
-69 to the power 422,667,121
-69 to the power 5-1,564,031,349
First ten multiples-69, -138, -207, -276, -345, -414, -483, -552, -621, -690
Powers of twoBetween 2^6 (64) and 2^7 (128)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-6,900%
-69% as a decimal-0.69
-69% of 100-69
-69% of 1,000-690
As a fraction of 100-69/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -69
Nerdulate something else
Nothing in mind? Surprise me · today’s page