Nerdulator> put something in

Recognised as Number

-12,435

  • Negative
  • Odd
  • 5 digits

-12,435 is an odd 5-digit integer and the negative of 12,435. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value12,435
Digit count5
Digit sum15
Digit product120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 5 × 829
Distinct prime factors33, 5, 829
Number of divisors8
Sum of divisors σ(n)19,920
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 829, 2,487, 4,145, 12,4358 in total

Arithmetic

Previous number-12,436
Next number-12,434
Double-24,870
Cube root-23.167647136
Negation12,435
Reciprocal-0.0000804182

Representations

Decimal-12,435
Binary1100001001001114 bits
Octal30223
Hexadecimal3093
Base 369LF
In wordsminus twelve thousand, four hundred and thirty-five
Ordinalminus twelve thousand, four hundred and thirty-fifth
Scientific notation-1.2435 × 10^4
Engineering notation-12.435 × 10^3

In other bases

Ternary122001120base 3; the most digit-efficient integer base after e: 9 digits
Quinary344220base 5; one hand: 6 digits
Septenary51153base 7: 5 digits
Nonary18046base 9; each digit is two ternary digits: 5 digits
Duodecimal7243base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1b1fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:27:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010T1110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100111101101101
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes230 93
Gray code10100011011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100111101101101two's complement
32-bit11111111111111111100111101101101two's complement
64-bit1111111111111111111111111111111111111111111111111100111101101101two's complement
One's complement0011000010010010at 16 bits, every bit flipped
Bits reversed1011011011110011at 16 bits
Rotated left by 11001111011011011at 16 bits, wrapping
Shifted left by 1-110000100100110= -24,870, no wrap
Shifted right by 1-1100001001010= -6,217, discarding the low bit
These bits as a double6.14370631 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+12,437
Nearest square below12,321
Nearest square above12,544

Powers & multiples

-12,435 to the power 2154,629,225
-12,435 to the power 3-1,922,814,412,875
-12,435 to the power 423,910,197,224,100,625
-12,435 to the power 5-297,323,302,481,691,271,875
First ten multiples-12,435, -24,870, -37,305, -49,740, -62,175, -74,610, -87,045, -99,480, -111,915, -124,350
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35

As a percentage & fraction

As a percentage-1,243,500%
-12,435% as a decimal-124.35
-12,435% of 100-12,435
-12,435% of 1,000-124,350
As a fraction of 100-12,435/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-12435” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.