Recognised as Number
-146,365
- Negative
- Odd
- 6 digits
-146,365 is an odd 6-digit integer and the negative of 146,365. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value146,365
Digit count6
Digit sum25
Digit product2,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 73 × 401
Distinct prime factors35, 73, 401
Number of divisors8
Sum of divisors σ(n)178,488
SquarefreeYesno repeated prime factor
All divisors1, 5, 73, 365, 401, 2,005, 29,273, 146,3658 in total
Arithmetic
Representations
Decimal-146,365
Binary10001110111011110118 bits
Octal435675
Hexadecimal23BBD
Base 3634XP
In wordsminus one hundred and forty-six thousand, three hundred and sixty-five
Ordinalminus one hundred and forty-six thousand, three hundred and sixty-fifth
Scientific notation-1.46365 × 10^5
Engineering notation-146.365 × 10^3
In other bases
Ternary21102202221base 3; the most digit-efficient integer base after e: 11 digits
Quinary14140430base 5; one hand: 8 digits
Septenary1146502base 7: 7 digits
Nonary242687base 9; each digit is two ternary digits: 6 digits
Duodecimal70851base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali5i5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:39:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT01T001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100010001000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100010001000011
Bit length18 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits6within that length
Bit parityeven12 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 3b bd
Gray code110010011001100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100010001000011two's complement
64-bit1111111111111111111111111111111111111111111111011100010001000011two's complement
One's complement00000000000000100011101110111100at 32 bits, every bit flipped
Bits reversed11000010001000111011111111111111at 32 bits
Rotated left by 111111111111110111000100010000111at 32 bits, wrapping
Shifted left by 1-1000111011101111010= -292,730, no wrap
Shifted right by 1-10001110111011111= -73,182, discarding the low bit
These bits as a double7.23139183 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-146,365 to the power 221,422,713,225
-146,365 to the power 3-3,135,535,421,177,125
-146,365 to the power 4458,932,641,920,589,900,625
-146,365 to the power 5-67,171,676,134,707,140,804,978,125
First ten multiples-146,365, -292,730, -439,095, -585,460, -731,825, -878,190, -1,024,555, -1,170,920, -1,317,285, -1,463,650
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-14,636,500%
-146,365% as a decimal-1,463.65
-146,365% of 100-146,365
-146,365% of 1,000-1,463,650
As a fraction of 100-146,365/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -146,365
Nerdulate something else
Nothing in mind? Surprise me · today’s page