Recognised as Number
-13,073,301
- Negative
- Odd
- 8 digits
-13,073,301 is an odd 8-digit integer and the negative of 13,073,301. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,073,301
Digit count8
Digit sum18
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 × 3^2 × 41 × 71 × 499
Distinct prime factors43, 41, 71, 499
Number of divisors24
Sum of divisors σ(n)19,656,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 41, 71, 123, 213, 369, 499, 639, 1,497, 2,911, 4,491, 8,733, 20,459, 26,199, 35,429, 61,377, 106,287, 184,131, 318,861, 1,452,589, 4,357,767, 13,073,30124 in total
Arithmetic
Previous number-13,073,302
Next number-13,073,300
Double-26,146,602
Half-6,536,650.5
Square170,911,199,036,601
Cube-2,234,373,549,276,394,889,901
Cube root-235.574577108≈
Negation13,073,301
Reciprocal-7.64917751 × 10^-8≈
Representations
Decimal-13,073,301
Binary11000111011110111001010124 bits
Octal61675625
HexadecimalC77B95
Base 367S7F9
In wordsminus thirteen million, seventy-three thousand, three hundred and one
Ordinalminus thirteen million, seventy-three thousand, three hundred and first
Scientific notation-1.3073301 × 10^7
Engineering notation-13.073301 × 10^6
In other bases
Ternary220121012012100base 3; the most digit-efficient integer base after e: 15 digits
Quinary11321321201base 5; one hand: 11 digits
Septenary216056403base 7: 9 digits
Nonary26535170base 9; each digit is two ternary digits: 8 digits
Duodecimal4465699base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal41e351base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:0:31:28:21base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T11TT11T11T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010011000010110111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001110001000010001101011
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes3c7 7b 95
Gray code101001001100011001011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001110001000010001101011two's complement
64-bit1111111111111111111111111111111111111111001110001000010001101011two's complement
One's complement00000000110001110111101110010100at 32 bits, every bit flipped
Bits reversed11010110001000010001110011111111at 32 bits
Rotated left by 111111110011100010000100011010111at 32 bits, wrapping
Shifted left by 1-1100011101111011100101010= -26,146,602, no wrap
Shifted right by 1-11000111011110111001011= -6,536,650, discarding the low bit
These bits as a double6.4590689 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,073,301 to the power 2170,911,199,036,601
-13,073,301 to the power 3-2,234,373,549,276,394,889,901
-13,073,301 to the power 429,210,637,956,128,642,590,537,633,201
-13,073,301 to the power 5-381,879,462,402,494,539,307,518,230,664,266,501
First ten multiples-13,073,301, -26,146,602, -39,219,903, -52,293,204, -65,366,505, -78,439,806, -91,513,107, -104,586,408, -117,659,709, -130,733,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-1,307,330,100%
-13,073,301% as a decimal-130,733.01
-13,073,301% of 100-13,073,301
-13,073,301% of 1,000-130,733,010
As a fraction of 100-13,073,301/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,073,301
Also reads as
13073301 (identifier)
- 8 characters
- Checksum fails
13073301 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