Recognised as Number
-105,473
- Negative
- Odd
- 6 digits
-105,473 is an odd 6-digit integer and the negative of 105,473. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value105,473
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 29 × 3,637
Distinct prime factors229, 3,637
Number of divisors4
Sum of divisors σ(n)109,140
SquarefreeYesno repeated prime factor
All divisors1, 29, 3,637, 105,4734 in total
Arithmetic
Representations
Decimal-105,473
Binary1100111000000000117 bits
Octal316001
Hexadecimal19C01
Base 3629DT
In wordsminus one hundred and five thousand, four hundred and seventy-three
Ordinalminus one hundred and five thousand, four hundred and seventy-third
Scientific notation-1.05473 × 10^5
Engineering notation-105.473 × 10^3
In other bases
Ternary12100200102base 3; the most digit-efficient integer base after e: 11 digits
Quinary11333343base 5; one hand: 8 digits
Septenary616334base 7: 6 digits
Nonary170612base 9; each digit is two ternary digits: 6 digits
Duodecimal51055base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald3ddbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:17:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T0T100TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010010000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100110001111111111
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; 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 9c 01
Gray code10101001000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100110001111111111two's complement
64-bit1111111111111111111111111111111111111111111111100110001111111111two's complement
One's complement00000000000000011001110000000000at 32 bits, every bit flipped
Bits reversed11111111110001100111111111111111at 32 bits
Rotated left by 111111111111111001100011111111111at 32 bits, wrapping
Shifted left by 1-110011100000000010= -210,946, no wrap
Shifted right by 1-1100111000000001= -52,736, discarding the low bit
These bits as a double5.21105859 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-105,473 to the power 211,124,553,729
-105,473 to the power 3-1,173,340,055,458,817
-105,473 to the power 4123,755,695,669,407,805,441
-105,473 to the power 5-13,052,884,489,339,449,463,278,593
First ten multiples-105,473, -210,946, -316,419, -421,892, -527,365, -632,838, -738,311, -843,784, -949,257, -1,054,730
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-10,547,300%
-105,473% as a decimal-1,054.73
-105,473% of 100-105,473
-105,473% of 1,000-1,054,730
As a fraction of 100-105,473/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -105,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page