Recognised as Number
-10,004,569
- Negative
- Odd
- Perfect square
- 8 digits
-10,004,569 is an odd 8-digit integer and the negative of 10,004,569. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,004,569
Digit count8
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,163²
Factors & divisors
Prime factorisation−1 × 3,163^2
Distinct prime factors13,163
Number of divisors3
Sum of divisors σ(n)10,007,733
SquarefreeNohas a repeated prime factor
All divisors1, 3,163, 10,004,5693 in total
Arithmetic
Previous number-10,004,570
Next number-10,004,568
Double-20,009,138
Half-5,002,284.5
Square100,091,400,875,761
Cube-1,001,371,326,368,211,352,009
Cube root-215.476276048≈
Negation10,004,569
Reciprocal-9.99543309 × 10^-8≈
Representations
Decimal-10,004,569
Binary10011000101010000101100124 bits
Octal46124131
Hexadecimal98A859
Base 365YFKP
In wordsminus ten million, four thousand, five hundred and sixty-nine
Ordinalminus ten million, four thousand, five hundred and sixty-ninth
Scientific notation-1.0004569 × 10^7
Engineering notation-10.004569 × 10^6
In other bases
Ternary200211021200121base 3; the most digit-efficient integer base after e: 15 digits
Quinary10030121234base 5; one hand: 11 digits
Septenary151015561base 7: 9 digits
Nonary20737617base 9; each digit is two ternary digits: 8 digits
Duodecimal3425821base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32ab89base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:19:2:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T1TTT0110T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110001010100011111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011001110101011110100111
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes398 a8 59
Gray code110101001111110001110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011001110101011110100111two's complement
64-bit1111111111111111111111111111111111111111011001110101011110100111two's complement
One's complement00000000100110001010100001011000at 32 bits, every bit flipped
Bits reversed11100101111010101110011011111111at 32 bits
Rotated left by 111111110110011101010111101001111at 32 bits, wrapping
Shifted left by 1-1001100010101000010110010= -20,009,138, no wrap
Shifted right by 1-10011000101010000101101= -5,002,284, discarding the low bit
These bits as a double4.94291384 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,004,569 to the power 2100,091,400,875,761
-10,004,569 to the power 3-1,001,371,326,368,211,352,009
-10,004,569 to the power 410,018,288,529,272,289,877,757,329,121
-10,004,569 to the power 5-100,228,658,853,013,143,870,024,764,446,753,849
First ten multiples-10,004,569, -20,009,138, -30,013,707, -40,018,276, -50,022,845, -60,027,414, -70,031,983, -80,036,552, -90,041,121, -100,045,690
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-1,000,456,900%
-10,004,569% as a decimal-100,045.69
-10,004,569% of 100-10,004,569
-10,004,569% of 1,000-100,045,690
As a fraction of 100-10,004,569/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -10,004,569
Also reads as
10004569 (identifier)
- 8 characters
- Checksum fails
10004569 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page