Recognised as Number
-16,401,361
- Negative
- Odd
- 8 digits
-16,401,361 is an odd 8-digit integer and the negative of 16,401,361. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,401,361
Digit count8
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 43 × 191 × 1,997
Distinct prime factors343, 191, 1,997
Number of divisors8
Sum of divisors σ(n)16,879,104
SquarefreeYesno repeated prime factor
All divisors1, 43, 191, 1,997, 8,213, 85,871, 381,427, 16,401,3618 in total
Arithmetic
Previous number-16,401,362
Next number-16,401,360
Double-32,802,722
Half-8,200,680.5
Square269,004,642,652,321
Cube-4,412,042,254,816,714,208,881
Cube root-254.073846509≈
Negation16,401,361
Reciprocal-6.09705499 × 10^-8≈
Representations
Decimal-16,401,361
Binary11111010010000111101000124 bits
Octal76441721
HexadecimalFA43D1
Base 369RJDD
In wordsminus sixteen million, four hundred and one thousand, three hundred and sixty-one
Ordinalminus sixteen million, four hundred and one thousand, three hundred and sixty-first
Scientific notation-1.6401361 × 10^7
Engineering notation-16.401361 × 10^6
In other bases
Ternary1010212021102211base 3; the most digit-efficient integer base after e: 16 digits
Quinary13144320421base 5; one hand: 11 digits
Septenary256260244base 7: 9 digits
Nonary33767384base 9; each digit is two ternary digits: 8 digits
Duodecimal55ab641base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal52a381base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:15:55:56:1base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0TT011T1TTT01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110101100110001110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000001011011110000101111
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
Bytes3fa 43 d1
Gray code100001110110001000111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000001011011110000101111two's complement
64-bit1111111111111111111111111111111111111111000001011011110000101111two's complement
One's complement00000000111110100100001111010000at 32 bits, every bit flipped
Bits reversed11110100001111011010000011111111at 32 bits
Rotated left by 111111110000010110111100001011111at 32 bits, wrapping
Shifted left by 1-1111101001000011110100010= -32,802,722, no wrap
Shifted right by 1-11111010010000111101001= -8,200,680, discarding the low bit
These bits as a double8.10334902 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,401,361 to the power 2269,004,642,652,321
-16,401,361 to the power 3-4,412,042,254,816,714,208,881
-16,401,361 to the power 472,363,497,768,502,918,573,686,687,041
-16,401,361 to the power 5-1,186,859,850,123,910,797,080,640,455,053,462,801
First ten multiples-16,401,361, -32,802,722, -49,204,083, -65,605,444, -82,006,805, -98,408,166, -114,809,527, -131,210,888, -147,612,249, -164,013,610
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-1,640,136,100%
-16,401,361% as a decimal-164,013.61
-16,401,361% of 100-16,401,361
-16,401,361% of 1,000-164,013,610
As a fraction of 100-16,401,361/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -16,401,361
Also reads as
16401361 (identifier)
- 8 characters
- Checksum fails
16401361 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