Recognised as Number
-145,401
- Negative
- Odd
- 6 digits
-145,401 is an odd 6-digit integer and the negative of 145,401. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value145,401
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 × 17 × 2,851
Distinct prime factors33, 17, 2,851
Number of divisors8
Sum of divisors σ(n)205,344
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 2,851, 8,553, 48,467, 145,4018 in total
Arithmetic
Representations
Decimal-145,401
Binary10001101111111100118 bits
Octal433771
Hexadecimal237F9
Base 36346X
In wordsminus one hundred and forty-five thousand, four hundred and one
Ordinalminus one hundred and forty-five thousand, four hundred and first
Scientific notation-1.45401 × 10^5
Engineering notation-145.401 × 10^3
In other bases
Ternary21101110020base 3; the most digit-efficient integer base after e: 11 digits
Quinary14123101base 5; one hand: 8 digits
Septenary1143624base 7: 7 digits
Nonary241406base 9; each digit is two ternary digits: 6 digits
Duodecimal70189base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali3a1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:23:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TT0TTT0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101100000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100100000000111
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 37 f9
Gray code110010110000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100100000000111two's complement
64-bit1111111111111111111111111111111111111111111111011100100000000111two's complement
One's complement00000000000000100011011111111000at 32 bits, every bit flipped
Bits reversed11100000000100111011111111111111at 32 bits
Rotated left by 111111111111110111001000000001111at 32 bits, wrapping
Shifted left by 1-1000110111111110010= -290,802, no wrap
Shifted right by 1-10001101111111101= -72,700, discarding the low bit
These bits as a double7.1837639 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-145,401 to the power 221,141,450,801
-145,401 to the power 3-3,073,988,087,916,201
-145,401 to the power 4446,960,941,971,103,541,601
-145,401 to the power 5-64,988,567,923,540,426,052,327,001
First ten multiples-145,401, -290,802, -436,203, -581,604, -727,005, -872,406, -1,017,807, -1,163,208, -1,308,609, -1,454,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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-14,540,100%
-145,401% as a decimal-1,454.01
-145,401% of 100-145,401
-145,401% of 1,000-1,454,010
As a fraction of 100-145,401/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -145,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page