Recognised as Number
-14,137,210
- Negative
- Even
- 8 digits
-14,137,210 is an even 8-digit integer and the negative of 14,137,210. It has 36 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value14,137,210
Digit count8
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 29^2 × 41^2
Distinct prime factors42, 5, 29, 41
Number of divisors36
Sum of divisors σ(n)27,013,194
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 29, 41, 58, 82, 145, 205, 290, 410, 841, 1,189, 1,681, 1,682, 2,378, 3,362, 4,205, 5,945, 8,405, 8,410, 11,890, 16,810, 34,481, 48,749, 68,962, 97,498, 172,405, 243,745, 344,810, 487,490, 1,413,721, 2,827,442, 7,068,605, 14,137,21036 in total
Arithmetic
Previous number-14,137,211
Next number-14,137,209
Double-28,274,420
Half-7,068,605
Square199,860,706,584,100
Cube-2,825,472,779,727,804,361,000
Cube root-241.799038592≈
Negation14,137,210
Reciprocal-7.07353148 × 10^-8≈
Representations
Decimal-14,137,210
Binary11010111101101110111101024 bits
Octal65733572
HexadecimalD7B77A
Base 368F0CA
In wordsminus fourteen million, one hundred and thirty-seven thousand, two hundred and ten
Ordinalminus fourteen million, one hundred and thirty-seven thousand, two hundred and tenth
Scientific notation-1.413721 × 10^7
Engineering notation-14.13721 × 10^6
In other bases
Ternary222121020121101base 3; the most digit-efficient integer base after e: 15 digits
Quinary12104342320base 5; one hand: 11 digits
Septenary231110233base 7: 9 digits
Nonary28536541base 9; each digit is two ternary digits: 8 digits
Duodecimal489930abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal48730abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:5:27:0:10base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00011TT1T11TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110000101100110011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001010000100100010000110
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 set bits, so odd; 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
Bytes3d7 b7 7a
Gray code101111000110110011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001010000100100010000110two's complement
64-bit1111111111111111111111111111111111111111001010000100100010000110two's complement
One's complement00000000110101111011011101111001at 32 bits, every bit flipped
Bits reversed01100001000100100001010011111111at 32 bits
Rotated left by 111111110010100001001000100001101at 32 bits, wrapping
Shifted left by 1-1101011110110111011110100= -28,274,420, no wrap
Shifted right by 1-11010111101101110111101= -7,068,605, discarding the low bit
These bits as a double6.98470979 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-14,137,210 to the power 2199,860,706,584,100
-14,137,210 to the power 3-2,825,472,779,727,804,361,000
-14,137,210 to the power 439,944,302,036,295,713,090,372,810,000
-14,137,210 to the power 5-564,700,986,190,540,118,058,349,393,260,100,000
First ten multiples-14,137,210, -28,274,420, -42,411,630, -56,548,840, -70,686,050, -84,823,260, -98,960,470, -113,097,680, -127,234,890, -141,372,100
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 10
As a percentage & fraction
As a percentage-1,413,721,000%
-14,137,210% as a decimal-141,372.1
-14,137,210% of 100-14,137,210
-14,137,210% of 1,000-141,372,100
As a fraction of 100-14,137,210/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,137,210
Also reads as
14137210 (identifier)
- 8 characters
- Checksum valid
14137210 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for Luhn (cards, IMEI). 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 validmod 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