Recognised as Number
-16,401,363
- Negative
- Odd
- 8 digits
-16,401,363 is an odd 8-digit integer and the negative of 16,401,363. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,401,363
Digit count8
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 497,011
Distinct prime factors33, 11, 497,011
Number of divisors8
Sum of divisors σ(n)23,856,576
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 497,011, 1,491,033, 5,467,121, 16,401,3638 in total
Arithmetic
Previous number-16,401,364
Next number-16,401,362
Double-32,802,726
Half-8,200,681.5
Square269,004,708,257,769
Cube-4,412,043,868,844,766,939,147
Cube root-254.073856837≈
Negation16,401,363
Reciprocal-6.09705425 × 10^-8≈
Representations
Decimal-16,401,363
Binary11111010010000111101001124 bits
Octal76441723
HexadecimalFA43D3
Base 369RJDF
In wordsminus sixteen million, four hundred and one thousand, three hundred and sixty-three
Ordinalminus sixteen million, four hundred and one thousand, three hundred and sixty-third
Scientific notation-1.6401363 × 10^7
Engineering notation-16.401363 × 10^6
In other bases
Ternary1010212021102220base 3; the most digit-efficient integer base after e: 16 digits
Quinary13144320423base 5; one hand: 11 digits
Septenary256260246base 7: 9 digits
Nonary33767386base 9; each digit is two ternary digits: 8 digits
Duodecimal55ab643base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal52a383base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:15:55:56:3base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0TT011T1TTT0010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110101100110001111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000001011011110000101101
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 set bits, so even; 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 d3
Gray code100001110110001000111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000001011011110000101101two's complement
64-bit1111111111111111111111111111111111111111000001011011110000101101two's complement
One's complement00000000111110100100001111010010at 32 bits, every bit flipped
Bits reversed10110100001111011010000011111111at 32 bits
Rotated left by 111111110000010110111100001011011at 32 bits, wrapping
Shifted left by 1-1111101001000011110100110= -32,802,726, no wrap
Shifted right by 1-11111010010000111101010= -8,200,681, discarding the low bit
These bits as a double8.10335 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,401,363 to the power 2269,004,708,257,769
-16,401,363 to the power 3-4,412,043,868,844,766,939,147
-16,401,363 to the power 472,363,533,064,847,413,219,348,857,361
-16,401,363 to the power 5-1,186,860,573,759,064,963,821,539,233,212,983,043
First ten multiples-16,401,363, -32,802,726, -49,204,089, -65,605,452, -82,006,815, -98,408,178, -114,809,541, -131,210,904, -147,612,267, -164,013,630
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
As a percentage & fraction
As a percentage-1,640,136,300%
-16,401,363% as a decimal-164,013.63
-16,401,363% of 100-16,401,363
-16,401,363% of 1,000-164,013,630
As a fraction of 100-16,401,363/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,363
Also reads as
16401363 (identifier)
- 8 characters
- Checksum fails
16401363 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