Recognised as Number
-464,698
- Negative
- Even
- 6 digits
-464,698 is an even 6-digit integer and the negative of 464,698. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value464,698
Digit count6
Digit sum37
Digit product41,472
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 13 × 61 × 293
Distinct prime factors42, 13, 61, 293
Number of divisors16
Sum of divisors σ(n)765,576
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 26, 61, 122, 293, 586, 793, 1,586, 3,809, 7,618, 17,873, 35,746, 232,349, 464,69816 in total
Arithmetic
Representations
Decimal-464,698
Binary111000101110011101019 bits
Octal1613472
Hexadecimal7173A
Base 369YKA
In wordsminus four hundred and sixty-four thousand, six hundred and ninety-eight
Ordinalminus four hundred and sixty-four thousand, six hundred and ninety-eighth
Scientific notation-4.64698 × 10^5
Engineering notation-464.698 × 10^3
In other bases
Ternary212121110001base 3; the most digit-efficient integer base after e: 12 digits
Quinary104332243base 5; one hand: 9 digits
Septenary3643543base 7: 7 digits
Nonary777401base 9; each digit is two ternary digits: 6 digits
Duodecimal1a4b0abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2i1eibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:9:4:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01011TTT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011100111011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110001110100011000110
Bit length19 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits8within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes307 17 3a
Gray code1001001110010100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110001110100011000110two's complement
64-bit1111111111111111111111111111111111111111111110001110100011000110two's complement
One's complement00000000000001110001011100111001at 32 bits, every bit flipped
Bits reversed01100011000101110001111111111111at 32 bits
Rotated left by 111111111111100011101000110001101at 32 bits, wrapping
Shifted left by 1-11100010111001110100= -929,396, no wrap
Shifted right by 1-111000101110011101= -232,349, discarding the low bit
These bits as a double2.29591317 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-464,698 to the power 2215,944,231,204
-464,698 to the power 3-100,348,852,352,036,392
-464,698 to the power 446,631,910,990,286,607,289,616
-464,698 to the power 5-21,669,755,773,364,205,834,269,975,968
First ten multiples-464,698, -929,396, -1,394,094, -1,858,792, -2,323,490, -2,788,188, -3,252,886, -3,717,584, -4,182,282, -4,646,980
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 98
As a percentage & fraction
As a percentage-46,469,800%
-464,698% as a decimal-4,646.98
-464,698% of 100-464,698
-464,698% of 1,000-4,646,980
As a fraction of 100-464,698/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -464,698
Nerdulate something else
Nothing in mind? Surprise me · today’s page