Recognised as Number
-47,901
- Negative
- Odd
- 5 digits
-47,901 is an odd 5-digit integer and the negative of 47,901. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value47,901
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 2,281
Distinct prime factors33, 7, 2,281
Number of divisors8
Sum of divisors σ(n)73,024
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 2,281, 6,843, 15,967, 47,9018 in total
Arithmetic
Representations
Decimal-47,901
Binary101110110001110116 bits
Octal135435
HexadecimalBB1D
Base 3610YL
In wordsminus forty-seven thousand, nine hundred and one
Ordinalminus forty-seven thousand, nine hundred and first
Scientific notation-4.7901 × 10^4
Engineering notation-47.901 × 10^3
In other bases
Ternary2102201010base 3; the most digit-efficient integer base after e: 10 digits
Quinary3013101base 5; one hand: 7 digits
Septenary256440base 7: 6 digits
Nonary72633base 9; each digit is two ternary digits: 5 digits
Duodecimal23879base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5jf1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:18:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TT010T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100010100100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110100010011100011
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2bb 1d
Gray code1110011010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110100010011100011two's complement
64-bit1111111111111111111111111111111111111111111111110100010011100011two's complement
One's complement00000000000000001011101100011100at 32 bits, every bit flipped
Bits reversed11000111001000101111111111111111at 32 bits
Rotated left by 111111111111111101000100111000111at 32 bits, wrapping
Shifted left by 1-10111011000111010= -95,802, no wrap
Shifted right by 1-101110110001111= -23,950, discarding the low bit
These bits as a double2.36662385 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-47,901 to the power 22,294,505,801
-47,901 to the power 3-109,909,122,373,701
-47,901 to the power 45,264,756,870,822,651,601
-47,901 to the power 5-252,187,118,869,275,834,339,501
First ten multiples-47,901, -95,802, -143,703, -191,604, -239,505, -287,406, -335,307, -383,208, -431,109, -479,010
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-4,790,100%
-47,901% as a decimal-479.01
-47,901% of 100-47,901
-47,901% of 1,000-479,010
As a fraction of 100-47,901/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -47,901
Nerdulate something else
Nothing in mind? Surprise me · today’s page