Recognised as Number
-13,983,235
- Negative
- Odd
- 8 digits
-13,983,235 is an odd 8-digit integer and the negative of 13,983,235. It has 24 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,983,235
Digit count8
Digit sum34
Digit product19,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 7 × 67^2 × 89
Distinct prime factors45, 7, 67, 89
Number of divisors24
Sum of divisors σ(n)19,686,240
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 35, 67, 89, 335, 445, 469, 623, 2,345, 3,115, 4,489, 5,963, 22,445, 29,815, 31,423, 41,741, 157,115, 208,705, 399,521, 1,997,605, 2,796,647, 13,983,23524 in total
Arithmetic
Previous number-13,983,236
Next number-13,983,234
Double-27,966,470
Half-6,991,617.5
Square195,530,861,065,225
Cube-2,734,153,980,027,391,502,875
Cube root-240.917983145≈
Negation13,983,235
Reciprocal-7.15142097 × 10^-8≈
Representations
Decimal-13,983,235
Binary11010101010111100000001124 bits
Octal65257003
HexadecimalD55E03
Base 368BPJ7
In wordsminus thirteen million, nine hundred and eighty-three thousand, two hundred and thirty-five
Ordinalminus thirteen million, nine hundred and eighty-three thousand, two hundred and thirty-fifth
Scientific notation-1.3983235 × 10^7
Engineering notation-13.983235 × 10^6
In other bases
Ternary222022102101121base 3; the most digit-efficient integer base after e: 15 digits
Quinary12034430420base 5; one hand: 11 digits
Septenary226566310base 7: 9 digits
Nonary28272347base 9; each digit is two ternary digits: 8 digits
Duodecimal4824197base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal477i1fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:4:44:13:55base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT001T01TT1TT111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111111110011000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001010101010000111111101
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
Bytes3d5 5e 03
Gray code101111111111000100000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001010101010000111111101two's complement
64-bit1111111111111111111111111111111111111111001010101010000111111101two's complement
One's complement00000000110101010101111000000010at 32 bits, every bit flipped
Bits reversed10111111100001010101010011111111at 32 bits
Rotated left by 111111110010101010100001111111011at 32 bits, wrapping
Shifted left by 1-1101010101011110000000110= -27,966,470, no wrap
Shifted right by 1-11010101010111100000010= -6,991,617, discarding the low bit
These bits as a double6.90863603 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,983,235 to the power 2195,530,861,065,225
-13,983,235 to the power 3-2,734,153,980,027,391,502,875
-13,983,235 to the power 438,232,317,628,908,321,821,704,300,625
-13,983,235 to the power 5-534,611,481,999,667,857,488,519,336,150,021,875
First ten multiples-13,983,235, -27,966,470, -41,949,705, -55,932,940, -69,916,175, -83,899,410, -97,882,645, -111,865,880, -125,849,115, -139,832,350
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 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 35
As a percentage & fraction
As a percentage-1,398,323,500%
-13,983,235% as a decimal-139,832.35
-13,983,235% of 100-13,983,235
-13,983,235% of 1,000-139,832,350
As a fraction of 100-13,983,235/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,983,235
Also reads as
13983235 (identifier)
- 8 characters
- Checksum fails
13983235 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