Recognised as Number
-15,375,011
- Negative
- Odd
- 8 digits
-15,375,011 is an odd 8-digit integer and the negative of 15,375,011. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value15,375,011
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 × 15,375,011
Distinct prime factors115,375,011
Number of divisors2
Sum of divisors σ(n)15,375,012
SquarefreeYesno repeated prime factor
All divisors1, 15,375,0112 in total
Arithmetic
Previous number-15,375,012
Next number-15,375,010
Double-30,750,022
Half-7,687,505.5
Square236,390,963,250,121
Cube-3,634,513,660,271,206,126,331
Cube root-248.659550964≈
Negation15,375,011
Reciprocal-6.50406039 × 10^-8≈
Representations
Decimal-15,375,011
Binary11101010100110101010001124 bits
Octal72515243
HexadecimalEA9AA3
Base 3695JFN
In wordsminus fifteen million, three hundred and seventy-five thousand and eleven
Ordinalminus fifteen million, three hundred and seventy-five thousand and eleventh
Scientific notation-1.5375011 × 10^7
Engineering notation-15.375011 × 10^6
In other bases
Ternary1001221010112212base 3; the most digit-efficient integer base after e: 16 digits
Quinary12414000021base 5; one hand: 11 digits
Septenary244454051base 7: 9 digits
Nonary31833485base 9; each digit is two ternary digits: 8 digits
Duodecimal51956abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4g1habbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:11:10:50:11base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0T101T0TT110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010101011101010101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000101010110010101011101
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
Bytes3ea 9a a3
Gray code100111111101011111110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000101010110010101011101two's complement
64-bit1111111111111111111111111111111111111111000101010110010101011101two's complement
One's complement00000000111010101001101010100010at 32 bits, every bit flipped
Bits reversed10111010101001101010100011111111at 32 bits
Rotated left by 111111110001010101100101010111011at 32 bits, wrapping
Shifted left by 1-1110101010011010101000110= -30,750,022, no wrap
Shifted right by 1-11101010100110101010010= -7,687,505, discarding the low bit
These bits as a double7.59626474 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-15,375,011 to the power 2236,390,963,250,121
-15,375,011 to the power 3-3,634,513,660,271,206,126,331
-15,375,011 to the power 455,880,687,506,320,057,175,606,514,641
-15,375,011 to the power 5-859,166,185,097,233,448,595,579,094,277,036,051
First ten multiples-15,375,011, -30,750,022, -46,125,033, -61,500,044, -76,875,055, -92,250,066, -107,625,077, -123,000,088, -138,375,099, -153,750,110
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-1,537,501,100%
-15,375,011% as a decimal-153,750.11
-15,375,011% of 100-15,375,011
-15,375,011% of 1,000-153,750,110
As a fraction of 100-15,375,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -15,375,011
Also reads as
15375011 (identifier)
- 8 characters
- Checksum fails
15375011 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