Recognised as Number
-40,463
- Negative
- Odd
- 5 digits
-40,463 is an odd 5-digit integer and the negative of 40,463. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value40,463
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 43 × 941
Distinct prime factors243, 941
Number of divisors4
Sum of divisors σ(n)41,448
SquarefreeYesno repeated prime factor
All divisors1, 43, 941, 40,4634 in total
Arithmetic
Representations
Decimal-40,463
Binary100111100000111116 bits
Octal117017
Hexadecimal9E0F
Base 36V7Z
In wordsminus forty thousand, four hundred and sixty-three
Ordinalminus forty thousand, four hundred and sixty-third
Scientific notation-4.0463 × 10^4
Engineering notation-40.463 × 10^3
In other bases
Ternary2001111122base 3; the most digit-efficient integer base after e: 10 digits
Quinary2243323base 5; one hand: 7 digits
Septenary225653base 7: 6 digits
Nonary61448base 9; each digit is two ternary digits: 5 digits
Duodecimal1b4bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5133base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:14:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10T1111101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010011000110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110110000111110001
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes29e 0f
Gray code1101000100001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110110000111110001two's complement
64-bit1111111111111111111111111111111111111111111111110110000111110001two's complement
One's complement00000000000000001001111000001110at 32 bits, every bit flipped
Bits reversed10001111100001101111111111111111at 32 bits
Rotated left by 111111111111111101100001111100011at 32 bits, wrapping
Shifted left by 1-10011110000011110= -80,926, no wrap
Shifted right by 1-100111100001000= -20,231, discarding the low bit
These bits as a double1.99913782 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-40,463 to the power 21,637,254,369
-40,463 to the power 3-66,248,223,532,847
-40,463 to the power 42,680,601,868,809,588,161
-40,463 to the power 5-108,465,193,417,642,365,758,543
First ten multiples-40,463, -80,926, -121,389, -161,852, -202,315, -242,778, -283,241, -323,704, -364,167, -404,630
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
As a percentage & fraction
As a percentage-4,046,300%
-40,463% as a decimal-404.63
-40,463% of 100-40,463
-40,463% of 1,000-404,630
As a fraction of 100-40,463/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -40,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page