Recognised as Number
-142,701
- Negative
- Odd
- 6 digits
-142,701 is an odd 6-digit integer and the negative of 142,701. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value142,701
Digit count6
Digit sum15
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 × 13 × 3,659
Distinct prime factors33, 13, 3,659
Number of divisors8
Sum of divisors σ(n)204,960
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 39, 3,659, 10,977, 47,567, 142,7018 in total
Arithmetic
Representations
Decimal-142,701
Binary10001011010110110118 bits
Octal426555
Hexadecimal22D6D
Base 36323X
In wordsminus one hundred and forty-two thousand, seven hundred and one
Ordinalminus one hundred and forty-two thousand, seven hundred and first
Scientific notation-1.42701 × 10^5
Engineering notation-142.701 × 10^3
In other bases
Ternary21020202020base 3; the most digit-efficient integer base after e: 11 digits
Quinary14031301base 5; one hand: 8 digits
Septenary1133016base 7: 7 digits
Nonary236666base 9; each digit is two ternary digits: 6 digits
Duodecimal6a6b9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalhgf1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal39:38:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TT1T1T1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101011110010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011101001010010011
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 2d 6d
Gray code110011101111011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011101001010010011two's complement
64-bit1111111111111111111111111111111111111111111111011101001010010011two's complement
One's complement00000000000000100010110101101100at 32 bits, every bit flipped
Bits reversed11001001010010111011111111111111at 32 bits
Rotated left by 111111111111110111010010100100111at 32 bits, wrapping
Shifted left by 1-1000101101011011010= -285,402, no wrap
Shifted right by 1-10001011010110111= -71,350, discarding the low bit
These bits as a double7.05036617 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-142,701 to the power 220,363,575,401
-142,701 to the power 3-2,905,902,573,298,101
-142,701 to the power 4414,675,203,112,212,310,801
-142,701 to the power 5-59,174,566,159,315,808,963,613,501
First ten multiples-142,701, -285,402, -428,103, -570,804, -713,505, -856,206, -998,907, -1,141,608, -1,284,309, -1,427,010
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-14,270,100%
-142,701% as a decimal-1,427.01
-142,701% of 100-142,701
-142,701% of 1,000-1,427,010
As a fraction of 100-142,701/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -142,701
Nerdulate something else
Nothing in mind? Surprise me · today’s page