Recognised as Number
-4,000,553
- Negative
- Odd
- 7 digits
-4,000,553 is an odd 7-digit integer and the negative of 4,000,553. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value4,000,553
Digit count7
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 × 4,000,553
Distinct prime factors14,000,553
Number of divisors2
Sum of divisors σ(n)4,000,554
SquarefreeYesno repeated prime factor
All divisors1, 4,000,5532 in total
Arithmetic
Previous number-4,000,554
Next number-4,000,552
Double-8,001,106
Half-2,000,276.5
Square16,004,424,305,809
Cube-64,026,547,669,877,112,377
Cube root-158.747420133≈
Negation4,000,553
Reciprocal-2.49965442 × 10^-7≈
Representations
Decimal-4,000,553
Binary111101000010110010100122 bits
Octal17205451
Hexadecimal3D0B29
Base 362DQUH
In wordsminus four million, five hundred and fifty-three
Ordinalminus four million, five hundred and fifty-third
Scientific notation-4.000553 × 10^6
Engineering notation-4.000553 × 10^6
In other bases
Ternary21112020201122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2011004203base 5; one hand: 10 digits
Septenary46001264base 7: 8 digits
Nonary7466648base 9; each digit is two ternary digits: 7 digits
Duodecimal140b175base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15017dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:31:15:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01111T1T1T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110001110011010100101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111110000101111010011010111
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33d 0b 29
Gray code1000111000111010111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111110000101111010011010111two's complement
64-bit1111111111111111111111111111111111111111110000101111010011010111two's complement
One's complement00000000001111010000101100101000at 32 bits, every bit flipped
Bits reversed11101011001011110100001111111111at 32 bits
Rotated left by 111111111100001011110100110101111at 32 bits, wrapping
Shifted left by 1-11110100001011001010010= -8,001,106, no wrap
Shifted right by 1-111101000010110010101= -2,000,276, discarding the low bit
These bits as a double1.9765358 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-4,000,553 to the power 216,004,424,305,809
-4,000,553 to the power 3-64,026,547,669,877,112,377
-4,000,553 to the power 4256,141,597,360,369,891,551,144,481
-4,000,553 to the power 5-1,024,708,035,744,819,850,754,605,706,897,993
First ten multiples-4,000,553, -8,001,106, -12,001,659, -16,002,212, -20,002,765, -24,003,318, -28,003,871, -32,004,424, -36,004,977, -40,005,530
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-400,055,300%
-4,000,553% as a decimal-40,005.53
-4,000,553% of 100-4,000,553
-4,000,553% of 1,000-40,005,530
As a fraction of 100-4,000,553/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -4,000,553
Nerdulate something else
Nothing in mind? Surprise me · today’s page