Recognised as Number
-67,465
- Negative
- Odd
- 5 digits
-67,465 is an odd 5-digit integer and the negative of 67,465. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value67,465
Digit count5
Digit sum28
Digit product5,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 103 × 131
Distinct prime factors35, 103, 131
Number of divisors8
Sum of divisors σ(n)82,368
SquarefreeYesno repeated prime factor
All divisors1, 5, 103, 131, 515, 655, 13,493, 67,4658 in total
Arithmetic
Representations
Decimal-67,465
Binary1000001111000100117 bits
Octal203611
Hexadecimal10789
Base 361G21
In wordsminus sixty-seven thousand, four hundred and sixty-five
Ordinalminus sixty-seven thousand, four hundred and sixty-fifth
Scientific notation-6.7465 × 10^4
Engineering notation-67.465 × 10^3
In other bases
Ternary10102112201base 3; the most digit-efficient integer base after e: 11 digits
Quinary4124330base 5; one hand: 7 digits
Septenary400456base 7: 6 digits
Nonary112481base 9; each digit is two ternary digits: 6 digits
Duodecimal33061base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal88d5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:44:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0TT011010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000100110001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101111100001110111
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 07 89
Gray code11000010001001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101111100001110111two's complement
64-bit1111111111111111111111111111111111111111111111101111100001110111two's complement
One's complement00000000000000010000011110001000at 32 bits, every bit flipped
Bits reversed11101110000111110111111111111111at 32 bits
Rotated left by 111111111111111011111000011101111at 32 bits, wrapping
Shifted left by 1-100000111100010010= -134,930, no wrap
Shifted right by 1-1000001111000101= -33,732, discarding the low bit
These bits as a double3.33321388 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-67,465 to the power 24,551,526,225
-67,465 to the power 3-307,068,716,769,625
-67,465 to the power 420,716,390,976,862,750,625
-67,465 to the power 5-1,397,631,317,254,045,470,915,625
First ten multiples-67,465, -134,930, -202,395, -269,860, -337,325, -404,790, -472,255, -539,720, -607,185, -674,650
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-6,746,500%
-67,465% as a decimal-674.65
-67,465% of 100-67,465
-67,465% of 1,000-674,650
As a fraction of 100-67,465/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -67,465
Nerdulate something else
Nothing in mind? Surprise me · today’s page