Recognised as Number
-429,498
- Negative
- Even
- 6 digits
-429,498 is an even 6-digit integer and the negative of 429,498. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value429,498
Digit count6
Digit sum36
Digit product20,736
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^2 × 107 × 223
Distinct prime factors42, 3, 107, 223
Number of divisors24
Sum of divisors σ(n)943,488
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 107, 214, 223, 321, 446, 642, 669, 963, 1,338, 1,926, 2,007, 4,014, 23,861, 47,722, 71,583, 143,166, 214,749, 429,49824 in total
Arithmetic
Representations
Decimal-429,498
Binary110100011011011101019 bits
Octal1506672
Hexadecimal68DBA
Base 3697EI
In wordsminus four hundred and twenty-nine thousand, four hundred and ninety-eight
Ordinalminus four hundred and twenty-nine thousand, four hundred and ninety-eighth
Scientific notation-4.29498 × 10^5
Engineering notation-429.498 × 10^3
In other bases
Ternary210211011100base 3; the most digit-efficient integer base after e: 12 digits
Quinary102220443base 5; one hand: 9 digits
Septenary3436116base 7: 7 digits
Nonary724140base 9; each digit is two ternary digits: 6 digits
Duodecimal188676base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2ddeibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:59:18:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1TT1TT0TTT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011011001011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110010111001001000110
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
Bytes306 8d ba
Gray code1011100101101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110010111001001000110two's complement
64-bit1111111111111111111111111111111111111111111110010111001001000110two's complement
One's complement00000000000001101000110110111001at 32 bits, every bit flipped
Bits reversed01100010010011101001111111111111at 32 bits
Rotated left by 111111111111100101110010010001101at 32 bits, wrapping
Shifted left by 1-11010001101101110100= -858,996, no wrap
Shifted right by 1-110100011011011101= -214,749, discarding the low bit
These bits as a double2.12200207 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-429,498 to the power 2184,468,532,004
-429,498 to the power 3-79,228,865,558,653,992
-429,498 to the power 434,028,639,299,710,772,256,016
-429,498 to the power 5-14,615,232,521,947,177,262,414,359,968
First ten multiples-429,498, -858,996, -1,288,494, -1,717,992, -2,147,490, -2,576,988, -3,006,486, -3,435,984, -3,865,482, -4,294,980
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
As a percentage & fraction
As a percentage-42,949,800%
-429,498% as a decimal-4,294.98
-429,498% of 100-429,498
-429,498% of 1,000-4,294,980
As a fraction of 100-429,498/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -429,498
Nerdulate something else
Nothing in mind? Surprise me · today’s page