Recognised as Number
-142,902
- Negative
- Even
- 6 digits
-142,902 is an even 6-digit integer and the negative of 142,902. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value142,902
Digit count6
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^2 × 17 × 467
Distinct prime factors42, 3, 17, 467
Number of divisors24
Sum of divisors σ(n)328,536
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 17, 18, 34, 51, 102, 153, 306, 467, 934, 1,401, 2,802, 4,203, 7,939, 8,406, 15,878, 23,817, 47,634, 71,451, 142,90224 in total
Arithmetic
Representations
Decimal-142,902
Binary10001011100011011018 bits
Octal427066
Hexadecimal22E36
Base 36329I
In wordsminus one hundred and forty-two thousand, nine hundred and two
Ordinalminus one hundred and forty-two thousand, nine hundred and second
Scientific notation-1.42902 × 10^5
Engineering notation-142.902 × 10^3
In other bases
Ternary21021000200base 3; the most digit-efficient integer base after e — 11 digits
Quinary14033102base 5; one hand — 8 digits
Septenary1133424base 7 — 7 digits
Nonary237020base 9; each digit is two ternary digits — 6 digits
Duodecimal6a846base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 5 digits
Vigesimalhh52base 20; hands and feet, and the Mayan and Yoruba systems — 4 digits
Sexagesimal39:41:42base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT1TT1T00T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101011011011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011101000111001010
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 17worth 131,072
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes302 2e 36
Gray code110011100100101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011101000111001010two's complement
64-bit1111111111111111111111111111111111111111111111011101000111001010two's complement
One's complement00000000000000100010111000110101at 32 bits, every bit flipped
Bits reversed01010011100010111011111111111111at 32 bits
Rotated left by 111111111111110111010001110010101at 32 bits, wrapping
Shifted left by 1-1000101110001101100= -285,804, no wrap
Shifted right by 1-10001011100011011= -71,451, discarding the low bit
These bits as a double7.06029689 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-142,902 to the power 220,420,981,604
-142,902 to the power 3-2,918,199,113,174,808
-142,902 to the power 4417,016,489,670,906,412,816
-142,902 to the power 5-59,592,490,406,951,868,204,232,032
First ten multiples-142,902, -285,804, -428,706, -571,608, -714,510, -857,412, -1,000,314, -1,143,216, -1,286,118, -1,429,020
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
As a percentage & fraction
As a percentage-14,290,200%
-142,902% as a decimal-1,429.02
-142,902% of 100-142,902
-142,902% of 1,000-1,429,020
As a fraction of 100-142,902/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -142,902
Nerdulate something else
Nothing in mind? Surprise me · today’s page