Recognised as Number
-147,013
- Negative
- Odd
- 6 digits
-147,013 is an odd 6-digit integer and the negative of 147,013. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value147,013
Digit count6
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 113 × 1,301
Distinct prime factors2113, 1,301
Number of divisors4
Sum of divisors σ(n)148,428
SquarefreeYesno repeated prime factor
All divisors1, 113, 1,301, 147,0134 in total
Arithmetic
Representations
Decimal-147,013
Binary10001111100100010118 bits
Octal437105
Hexadecimal23E45
Base 3635FP
In wordsminus one hundred and forty-seven thousand and thirteen
Ordinalminus one hundred and forty-seven thousand and thirteenth
Scientific notation-1.47013 × 10^5
Engineering notation-147.013 × 10^3
In other bases
Ternary21110122221base 3; the most digit-efficient integer base after e: 11 digits
Quinary14201023base 5; one hand: 8 digits
Septenary1151416base 7: 7 digits
Nonary243587base 9; each digit is two ternary digits: 6 digits
Duodecimal710b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali7adbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:50:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTTT10001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100011011001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100000110111011
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 odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 3e 45
Gray code110010000101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100000110111011two's complement
64-bit1111111111111111111111111111111111111111111111011100000110111011two's complement
One's complement00000000000000100011111001000100at 32 bits, every bit flipped
Bits reversed11011101100000111011111111111111at 32 bits
Rotated left by 111111111111110111000001101110111at 32 bits, wrapping
Shifted left by 1-1000111110010001010= -294,026, no wrap
Shifted right by 1-10001111100100011= -73,506, discarding the low bit
These bits as a double7.26340728 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-147,013 to the power 221,612,822,169
-147,013 to the power 3-3,177,365,825,531,197
-147,013 to the power 4467,114,082,108,817,864,561
-147,013 to the power 5-68,671,842,553,063,640,722,706,293
First ten multiples-147,013, -294,026, -441,039, -588,052, -735,065, -882,078, -1,029,091, -1,176,104, -1,323,117, -1,470,130
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-14,701,300%
-147,013% as a decimal-1,470.13
-147,013% of 100-147,013
-147,013% of 1,000-1,470,130
As a fraction of 100-147,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -147,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page