Recognised as Number
-10,004,567
- Negative
- Odd
- 8 digits
-10,004,567 is an odd 8-digit integer and the negative of 10,004,567. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,004,567
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2,423 × 4,129
Distinct prime factors22,423, 4,129
Number of divisors4
Sum of divisors σ(n)10,011,120
SquarefreeYesno repeated prime factor
All divisors1, 2,423, 4,129, 10,004,5674 in total
Arithmetic
Previous number-10,004,568
Next number-10,004,566
Double-20,009,134
Half-5,002,283.5
Square100,091,360,857,489
Cube-1,001,370,725,819,926,152,263
Cube root-215.476261689≈
Negation10,004,567
Reciprocal-9.99543508 × 10^-8≈
Representations
Decimal-10,004,567
Binary10011000101010000101011124 bits
Octal46124127
Hexadecimal98A857
Base 365YFKN
In wordsminus ten million, four thousand, five hundred and sixty-seven
Ordinalminus ten million, four thousand, five hundred and sixty-seventh
Scientific notation-1.0004567 × 10^7
Engineering notation-10.004567 × 10^6
In other bases
Ternary200211021200112base 3; the most digit-efficient integer base after e: 15 digits
Quinary10030121232base 5; one hand: 11 digits
Septenary151015556base 7: 9 digits
Nonary20737615base 9; each digit is two ternary digits: 8 digits
Duodecimal342581bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32ab87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:19:2:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T1TTT0110T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110001010100011111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011001110101011110101001
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; 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 57
Gray code110101001111110001111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011001110101011110101001two's complement
64-bit1111111111111111111111111111111111111111011001110101011110101001two's complement
One's complement00000000100110001010100001010110at 32 bits, every bit flipped
Bits reversed10010101111010101110011011111111at 32 bits
Rotated left by 111111110110011101010111101010011at 32 bits, wrapping
Shifted left by 1-1001100010101000010101110= -20,009,134, no wrap
Shifted right by 1-10011000101010000101100= -5,002,283, discarding the low bit
These bits as a double4.94291286 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,004,567 to the power 2100,091,360,857,489
-10,004,567 to the power 3-1,001,370,725,819,926,152,263
-10,004,567 to the power 410,018,280,518,304,081,125,367,385,121
-10,004,567 to the power 5-100,228,558,670,167,905,992,173,404,057,847,607
First ten multiples-10,004,567, -20,009,134, -30,013,701, -40,018,268, -50,022,835, -60,027,402, -70,031,969, -80,036,536, -90,041,103, -100,045,670
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-1,000,456,700%
-10,004,567% as a decimal-100,045.67
-10,004,567% of 100-10,004,567
-10,004,567% of 1,000-100,045,670
As a fraction of 100-10,004,567/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,567
Also reads as
10004567 (identifier)
- 8 characters
- Checksum fails
10004567 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