Recognised as Number
-14,377,731
- Negative
- Odd
- 8 digits
-14,377,731 is an odd 8-digit integer and the negative of 14,377,731. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value14,377,731
Digit count8
Digit sum33
Digit product12,348
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 67 × 233 × 307
Distinct prime factors43, 67, 233, 307
Number of divisors16
Sum of divisors σ(n)19,603,584
SquarefreeYesno repeated prime factor
All divisors1, 3, 67, 201, 233, 307, 699, 921, 15,611, 20,569, 46,833, 61,707, 71,531, 214,593, 4,792,577, 14,377,73116 in total
Arithmetic
Previous number-14,377,732
Next number-14,377,730
Double-28,755,462
Half-7,188,865.5
Square206,719,148,708,361
Cube-2,972,152,312,677,811,908,891
Cube root-243.162603493≈
Negation14,377,731
Reciprocal-6.95520037 × 10^-8≈
Representations
Decimal-14,377,731
Binary11011011011000110000001124 bits
Octal66661403
HexadecimalDB6303
Base 368K5XF
In wordsminus fourteen million, three hundred and seventy-seven thousand, seven hundred and thirty-one
Ordinalminus fourteen million, three hundred and seventy-seven thousand, seven hundred and thirty-first
Scientific notation-1.4377731 × 10^7
Engineering notation-14.377731 × 10^6
In other bases
Ternary1000001110112120base 3; the most digit-efficient integer base after e: 16 digits
Quinary12140041411base 5; one hand: 11 digits
Septenary233131404base 7: 9 digits
Nonary30043476base 9; each digit is two ternary digits: 8 digits
Duodecimal4994543base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal49h46bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:6:33:48:51base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00000TTTT110110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011001011110110100001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001001001001110011111101
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 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
Bytes3db 63 03
Gray code101101101101001010000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001001001001110011111101two's complement
64-bit1111111111111111111111111111111111111111001001001001110011111101two's complement
One's complement00000000110110110110001100000010at 32 bits, every bit flipped
Bits reversed10111111001110010010010011111111at 32 bits
Rotated left by 111111110010010010011100111111011at 32 bits, wrapping
Shifted left by 1-1101101101100011000000110= -28,755,462, no wrap
Shifted right by 1-11011011011000110000010= -7,188,865, discarding the low bit
These bits as a double7.10354295 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-14,377,731 to the power 2206,719,148,708,361
-14,377,731 to the power 3-2,972,152,312,677,811,908,891
-14,377,731 to the power 442,732,806,442,709,469,294,631,306,321
-14,377,731 to the power 5-614,400,795,908,343,660,670,968,666,461,937,651
First ten multiples-14,377,731, -28,755,462, -43,133,193, -57,510,924, -71,888,655, -86,266,386, -100,644,117, -115,021,848, -129,399,579, -143,777,310
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 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-1,437,773,100%
-14,377,731% as a decimal-143,777.31
-14,377,731% of 100-14,377,731
-14,377,731% of 1,000-143,777,310
As a fraction of 100-14,377,731/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -14,377,731
Also reads as
14377731 (identifier)
- 8 characters
- Checksum fails
14377731 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