Recognised as Number
-10,004,151
- Negative
- Odd
- 8 digits
-10,004,151 is an odd 8-digit integer and the negative of 10,004,151. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,004,151
Digit count8
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 101 × 137 × 241
Distinct prime factors43, 101, 137, 241
Number of divisors16
Sum of divisors σ(n)13,625,568
SquarefreeYesno repeated prime factor
All divisors1, 3, 101, 137, 241, 303, 411, 723, 13,837, 24,341, 33,017, 41,511, 73,023, 99,051, 3,334,717, 10,004,15116 in total
Arithmetic
Previous number-10,004,152
Next number-10,004,150
Double-20,008,302
Half-5,002,075.5
Square100,083,037,230,801
Cube-1,001,245,816,995,555,054,951
Cube root-215.473275074≈
Negation10,004,151
Reciprocal-9.99585072 × 10^-8≈
Representations
Decimal-10,004,151
Binary10011000101001101011011124 bits
Octal46123267
Hexadecimal98A6B7
Base 365YF93
In wordsminus ten million, four thousand, one hundred and fifty-one
Ordinalminus ten million, four thousand, one hundred and fifty-first
Scientific notation-1.0004151 × 10^7
Engineering notation-10.004151 × 10^6
In other bases
Ternary200211021010010base 3; the most digit-efficient integer base after e: 15 digits
Quinary10030113101base 5; one hand: 11 digits
Septenary151014423base 7: 9 digits
Nonary20737103base 9; each digit is two ternary digits: 8 digits
Duodecimal3425533base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32aa7bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:18:55:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T1TTT1T0T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110001010100101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011001110101100101001001
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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 a6 b7
Gray code110101001111010111101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011001110101100101001001two's complement
64-bit1111111111111111111111111111111111111111011001110101100101001001two's complement
One's complement00000000100110001010011010110110at 32 bits, every bit flipped
Bits reversed10010010100110101110011011111111at 32 bits
Rotated left by 111111110110011101011001010010011at 32 bits, wrapping
Shifted left by 1-1001100010100110101101110= -20,008,302, no wrap
Shifted right by 1-10011000101001101011100= -5,002,075, discarding the low bit
These bits as a double4.94270732 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,004,151 to the power 2100,083,037,230,801
-10,004,151 to the power 3-1,001,245,816,995,555,054,951
-10,004,151 to the power 410,016,614,341,341,899,098,543,101,601
-10,004,151 to the power 5-100,207,722,379,549,901,208,589,068,424,745,751
First ten multiples-10,004,151, -20,008,302, -30,012,453, -40,016,604, -50,020,755, -60,024,906, -70,029,057, -80,033,208, -90,037,359, -100,041,510
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-1,000,415,100%
-10,004,151% as a decimal-100,041.51
-10,004,151% of 100-10,004,151
-10,004,151% of 1,000-100,041,510
As a fraction of 100-10,004,151/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,151
Also reads as
10004151 (identifier)
- 8 characters
- Checksum fails
10004151 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