Recognised as Number
-148,231
- Negative
- Odd
- 6 digits
-148,231 is an odd 6-digit integer and the negative of 148,231. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value148,231
Digit count6
Digit sum19
Digit product192
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 227 × 653
Distinct prime factors2227, 653
Number of divisors4
Sum of divisors σ(n)149,112
SquarefreeYesno repeated prime factor
All divisors1, 227, 653, 148,2314 in total
Arithmetic
Representations
Decimal-148,231
Binary10010000110000011118 bits
Octal441407
Hexadecimal24307
Base 3636DJ
In wordsminus one hundred and forty-eight thousand, two hundred and thirty-one
Ordinalminus one hundred and forty-eight thousand, two hundred and thirty-first
Scientific notation-1.48231 × 10^5
Engineering notation-148.231 × 10^3
In other bases
Ternary21112100001base 3; the most digit-efficient integer base after e: 11 digits
Quinary14220411base 5; one hand: 8 digits
Septenary1155106base 7: 7 digits
Nonary245301base 9; each digit is two ternary digits: 6 digits
Duodecimal71947base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaliabbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:10:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01111T0000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100110100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011110011111001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 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 43 07
Gray code110110001010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011110011111001two's complement
64-bit1111111111111111111111111111111111111111111111011011110011111001two's complement
One's complement00000000000000100100001100000110at 32 bits, every bit flipped
Bits reversed10011111001111011011111111111111at 32 bits
Rotated left by 111111111111110110111100111110011at 32 bits, wrapping
Shifted left by 1-1001000011000001110= -296,462, no wrap
Shifted right by 1-10010000110000100= -74,115, discarding the low bit
These bits as a double7.32358447 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-148,231 to the power 221,972,429,361
-148,231 to the power 3-3,256,995,176,610,391
-148,231 to the power 4482,787,652,024,134,868,321
-148,231 to the power 5-71,564,096,447,189,535,666,090,151
First ten multiples-148,231, -296,462, -444,693, -592,924, -741,155, -889,386, -1,037,617, -1,185,848, -1,334,079, -1,482,310
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-14,823,100%
-148,231% as a decimal-1,482.31
-148,231% of 100-148,231
-148,231% of 1,000-1,482,310
As a fraction of 100-148,231/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -148,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page