Nerdulator> put something in

Recognised as Number

-13,473,733

  • Negative
  • Odd
  • 8 digits

-13,473,733 is an odd 8-digit integer and the negative of 13,473,733. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value13,473,733
Digit count8
Digit sum31
Digit product15,876
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 7 × 13 × 148,063
Distinct prime factors37, 13, 148,063
Number of divisors8
Sum of divisors σ(n)16,583,168
SquarefreeYesno repeated prime factor
All divisors1, 7, 13, 91, 148,063, 1,036,441, 1,924,819, 13,473,7338 in total

Arithmetic

Previous number-13,473,734
Next number-13,473,732
Cube-2,446,041,442,816,148,923,837
Cube root-237.955626923≈
Negation13,473,733
Reciprocal-7.42184812 × 10^-8≈

Representations

Decimal-13,473,733
Binary11001101100101111100010124 bits
Octal63313705
HexadecimalCD97C5
Base 3680SED
In wordsminus thirteen million, four hundred and seventy-three thousand, seven hundred and thirty-three
Ordinalminus thirteen million, four hundred and seventy-three thousand, seven hundred and thirty-third
Scientific notation-1.3473733 × 10^7
Engineering notation-13.473733 × 10^6

In other bases

Ternary221100112111011base 3; the most digit-efficient integer base after e: 15 digits
Quinary11422124413base 5; one hand: 11 digits
Septenary222345010base 7: 9 digits
Nonary27315434base 9; each digit is two ternary digits: 8 digits
Duodecimal4619371base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal44446dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:22:42:13base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01TT0T111TTT0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101111011100001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001100100110100000111011
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes3cd 97 c5
Gray code101010110101110000100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001100100110100000111011two's complement
64-bit1111111111111111111111111111111111111111001100100110100000111011two's complement
One's complement00000000110011011001011111000100at 32 bits, every bit flipped
Bits reversed11011100000101100100110011111111at 32 bits
Rotated left by 111111110011001001101000001110111at 32 bits, wrapping
Shifted left by 1-1100110110010111110001010= -26,947,466, no wrap
Shifted right by 1-11001101100101111100011= -6,736,866, discarding the low bit
These bits as a double6.6569086 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,473,735
Nearest square below13,468,900
Nearest square above13,476,241

Powers & multiples

-13,473,733 to the power 2181,541,480,955,289
-13,473,733 to the power 3-2,446,041,442,816,148,923,837
-13,473,733 to the power 432,957,309,307,439,558,688,017,073,521
-13,473,733 to the power 5-444,057,986,006,855,527,400,172,348,063,323,893
First ten multiples-13,473,733, -26,947,466, -40,421,199, -53,894,932, -67,368,665, -80,842,398, -94,316,131, -107,789,864, -121,263,597, -134,737,330
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,347,373,300%
-13,473,733% as a decimal-134,737.33
-13,473,733% of 100-13,473,733
-13,473,733% of 1,000-134,737,330
As a fraction of 100-13,473,733/100

Keep nerding

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

Also reads as

13473733 (identifier)

  • 8 characters
  • Checksum fails

13473733 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.

Open this reading on its own page →

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

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