Nerdulator> put something in

Recognised as Number

-6,901

  • Negative
  • Odd
  • 4 digits

-6,901 is an odd 4-digit integer and the negative of 6,901. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value6,901
Digit count4
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 67 × 103
Distinct prime factors267, 103
Number of divisors4
Sum of divisors σ(n)7,072
SquarefreeYesno repeated prime factor
All divisors1, 67, 103, 6,9014 in total

Arithmetic

Previous number-6,902
Next number-6,900
Double-13,802
Cube root-19.038702275
Negation6,901
Reciprocal-0.0001449065

Representations

Decimal-6,901
Binary110101111010113 bits
Octal15365
Hexadecimal1AF5
Base 365BP
In wordsminus six thousand, nine hundred and one
Ordinalminus six thousand, nine hundred and first
Scientific notation-6.901 × 10^3
Engineering notation-6.901 × 10^3

In other bases

Ternary100110121base 3; the most digit-efficient integer base after e: 9 digits
Quinary210101base 5; one hand: 6 digits
Septenary26056base 7: 5 digits
Nonary10417base 9; each digit is two ternary digits: 5 digits
Duodecimal3bb1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalh51base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:55:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00TTT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110010100001011
Bit length13 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits4within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21a f5
Gray code1011110001111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110010100001011two's complement
32-bit11111111111111111110010100001011two's complement
64-bit1111111111111111111111111111111111111111111111111110010100001011two's complement
One's complement0001101011110100at 16 bits, every bit flipped
Bits reversed1101000010100111at 16 bits
Rotated left by 11100101000010111at 16 bits, wrapping
Shifted left by 1-11010111101010= -13,802, no wrap
Shifted right by 1-110101111011= -3,450, discarding the low bit
These bits as a double3.40954702 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+6,903
Nearest square below6,889
Nearest square above7,056

Powers & multiples

-6,901 to the power 247,623,801
-6,901 to the power 3-328,651,850,701
-6,901 to the power 42,268,026,421,687,601
-6,901 to the power 5-15,651,650,336,066,134,501
First ten multiples-6,901, -13,802, -20,703, -27,604, -34,505, -41,406, -48,307, -55,208, -62,109, -69,010
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)

Divisibility tests

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

As a percentage & fraction

As a percentage-690,100%
-6,901% as a decimal-69.01
-6,901% of 100-6,901
-6,901% of 1,000-69,010
As a fraction of 100-6,901/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 “-6901” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.