Recognised as Number
-148,483
- Negative
- Odd
- 6 digits
-148,483 is an odd 6-digit integer and the negative of 148,483. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value148,483
Digit count6
Digit sum28
Digit product3,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 148,483
Distinct prime factors1148,483
Number of divisors2
Sum of divisors σ(n)148,484
SquarefreeYesno repeated prime factor
All divisors1, 148,4832 in total
Arithmetic
Representations
Decimal-148,483
Binary10010001000000001118 bits
Octal442003
Hexadecimal24403
Base 3636KJ
In wordsminus one hundred and forty-eight thousand, four hundred and eighty-three
Ordinalminus one hundred and forty-eight thousand, four hundred and eighty-third
Scientific notation-1.48483 × 10^5
Engineering notation-148.483 × 10^3
In other bases
Ternary21112200101base 3; the most digit-efficient integer base after e: 11 digits
Quinary14222413base 5; one hand: 8 digits
Septenary1155616base 7: 7 digits
Nonary245611base 9; each digit is two ternary digits: 6 digits
Duodecimal71b17base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalib43base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:14:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01110100T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100110000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011101111111101
Bit length18 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits13within that length
Bit parityodd5 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 44 03
Gray code110110011000000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011101111111101two's complement
64-bit1111111111111111111111111111111111111111111111011011101111111101two's complement
One's complement00000000000000100100010000000010at 32 bits, every bit flipped
Bits reversed10111111110111011011111111111111at 32 bits
Rotated left by 111111111111110110111011111111011at 32 bits, wrapping
Shifted left by 1-1001000100000000110= -296,966, no wrap
Shifted right by 1-10010001000000010= -74,241, discarding the low bit
These bits as a double7.33603493 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-148,483 to the power 222,047,201,289
-148,483 to the power 3-3,273,634,588,994,587
-148,483 to the power 4486,079,084,677,683,261,521
-148,483 to the power 5-72,174,480,730,196,443,720,422,643
First ten multiples-148,483, -296,966, -445,449, -593,932, -742,415, -890,898, -1,039,381, -1,187,864, -1,336,347, -1,484,830
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
As a percentage & fraction
As a percentage-14,848,300%
-148,483% as a decimal-1,484.83
-148,483% of 100-148,483
-148,483% of 1,000-1,484,830
As a fraction of 100-148,483/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -148,483
Nerdulate something else
Nothing in mind? Surprise me · today’s page