Recognised as Number
-47,365,401
- Negative
- Odd
- 8 digits
-47,365,401 is an odd 8-digit integer and the negative of 47,365,401. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value47,365,401
Digit count8
Digit sum30
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 × 761 × 20,747
Distinct prime factors33, 761, 20,747
Number of divisors8
Sum of divisors σ(n)63,239,904
SquarefreeYesno repeated prime factor
All divisors1, 3, 761, 2,283, 20,747, 62,241, 15,788,467, 47,365,4018 in total
Arithmetic
Previous number-47,365,402
Next number-47,365,400
Double-94,730,802
Half-23,682,700.5
Square2,243,481,211,890,801
Cube-106,263,387,237,173,757,576,201
Cube root-361.815420792≈
Negation47,365,401
Reciprocal-2.11124572 × 10^-8≈
Representations
Decimal-47,365,401
Binary1011010010101111010001100126 bits
Octal264536431
Hexadecimal2D2BD19
Base 36S77DL
In wordsminus forty-seven million, three hundred and sixty-five thousand, four hundred and one
Ordinalminus forty-seven million, three hundred and sixty-five thousand, four hundred and first
Scientific notation-4.7365401 × 10^7
Engineering notation-47.365401 × 10^6
In other bases
Ternary10022010102010010base 3; the most digit-efficient integer base after e: 17 digits
Quinary44111143101base 5; one hand: 11 digits
Septenary1113412356base 7: 10 digits
Nonary108112103base 9; each digit is two ternary digits: 9 digits
Duodecimal13a42649base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 8 digits
Vigesimaleg0da1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal3:39:17:3:21base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0T010T0TT10T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011111010100011100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111101001011010100001011100111
Bit length26 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits12within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 25worth 33,554,432
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes402 d2 bd 19
Gray code11101110111110001110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111101001011010100001011100111two's complement
64-bit1111111111111111111111111111111111111101001011010100001011100111two's complement
One's complement00000010110100101011110100011000at 32 bits, every bit flipped
Bits reversed11100111010000101011010010111111at 32 bits
Rotated left by 111111010010110101000010111001111at 32 bits, wrapping
Shifted left by 1-101101001010111101000110010= -94,730,802, no wrap
Shifted right by 1-1011010010101111010001101= -23,682,700, discarding the low bit
These bits as a double2.34016174 × 10^-316≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-47,365,401 to the power 22,243,481,211,890,801
-47,365,401 to the power 3-106,263,387,237,173,757,576,201
-47,365,401 to the power 45,033,207,948,107,017,134,273,548,421,601
-47,365,401 to the power 5-238,399,912,778,476,057,478,737,464,682,048,427,001
First ten multiples-47,365,401, -94,730,802, -142,096,203, -189,461,604, -236,827,005, -284,192,406, -331,557,807, -378,923,208, -426,288,609, -473,654,010
Powers of twoBetween 2^25 (33,554,432) and 2^26 (67,108,864)
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-4,736,540,100%
-47,365,401% as a decimal-473,654.01
-47,365,401% of 100-47,365,401
-47,365,401% of 1,000-473,654,010
As a fraction of 100-47,365,401/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -47,365,401
Also reads as
47365401 (identifier)
- 8 characters
- Checksum fails
47365401 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page