Recognised as Number
-13,492,170
- Negative
- Even
- 8 digits
-13,492,170 is an even 8-digit integer and the negative of 13,492,170. It has 40 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value13,492,170
Digit count8
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^4 × 5 × 16,657
Distinct prime factors42, 3, 5, 16,657
Number of divisors40
Sum of divisors σ(n)36,281,124
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 81, 90, 135, 162, 270, 405, 810, 16,657, 33,314, 49,971, 83,285, 99,942, 149,913, 166,570, 249,855, 299,826, 449,739, 499,710, 749,565, 899,478, 1,349,217, 1,499,130, 2,248,695, 2,698,434, 4,497,390, 6,746,085, 13,492,17040 in total
Arithmetic
Previous number-13,492,171
Next number-13,492,169
Double-26,984,340
Half-6,746,085
Square182,038,651,308,900
Cube-2,456,096,430,030,401,313,000
Cube root-238.064114262≈
Negation13,492,170
Reciprocal-7.4117062 × 10^-8≈
Representations
Decimal-13,492,170
Binary11001101110111111100101024 bits
Octal63357712
HexadecimalCDDFCA
Base 36816MI
In wordsminus thirteen million, four hundred and ninety-two thousand, one hundred and seventy
Ordinalminus thirteen million, four hundred and ninety-two thousand, one hundred and seventieth
Scientific notation-1.349217 × 10^7
Engineering notation-13.49217 × 10^6
In other bases
Ternary221101110210000base 3; the most digit-efficient integer base after e: 15 digits
Quinary11423222140base 5; one hand: 11 digits
Septenary222452526base 7: 9 digits
Nonary27343700base 9; each digit is two ternary digits: 8 digits
Duodecimal4627b76base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal446a8abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:27:49:30base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01TT0TTTT1T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101100110000001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100100010000000110110
Bit length24 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits8within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes3cd df ca
Gray code101010110011000000101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100100010000000110110two's complement
64-bit1111111111111111111111111111111111111111001100100010000000110110two's complement
One's complement00000000110011011101111111001001at 32 bits, every bit flipped
Bits reversed01101100000001000100110011111111at 32 bits
Rotated left by 111111110011001000100000001101101at 32 bits, wrapping
Shifted left by 1-1100110111011111110010100= -26,984,340, no wrap
Shifted right by 1-11001101110111111100101= -6,746,085, discarding the low bit
These bits as a double6.66601768 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,492,170 to the power 2182,038,651,308,900
-13,492,170 to the power 3-2,456,096,430,030,401,313,000
-13,492,170 to the power 433,138,070,570,363,279,683,219,210,000
-13,492,170 to the power 5-447,104,481,607,338,331,243,539,728,585,700,000
First ten multiples-13,492,170, -26,984,340, -40,476,510, -53,968,680, -67,460,850, -80,953,020, -94,445,190, -107,937,360, -121,429,530, -134,921,700
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-1,349,217,000%
-13,492,170% as a decimal-134,921.7
-13,492,170% of 100-13,492,170
-13,492,170% of 1,000-134,921,700
As a fraction of 100-13,492,170/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -13,492,170
Also reads as
13492170 (identifier)
- 8 characters
- Checksum fails
13492170 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