Nerdulator> put something in

Recognised as Number

-473,275,506,257

  • Negative
  • Odd
  • Perfect cube
  • 12 digits

-473,275,506,257 is an odd 12-digit integer and the negative of 473,275,506,257. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value473,275,506,257
Digit count12
Digit sum53
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -7,793³

Factors & divisors

Prime factorisation−1 × 7,793^3
Distinct prime factors17,793
Number of divisors4
Sum of divisors σ(n)473,336,244,900
SquarefreeNohas a repeated prime factor
All divisors1, 7,793, 60,730,849, 473,275,506,2574 in total

Arithmetic

Previous number-473,275,506,258
Next number-473,275,506,256
Square223,989,704,822,819,646,150,049
Cube-106,008,840,946,375,962,517,870,041,460,356,593
Cube root-7,793
Reciprocal-2.11293419 × 10^-12

Representations

Decimal-473,275,506,257
Binary11011100011000101101011000111100101000139 bits
Octal6706132617121
Hexadecimal6E316B1E51
Base 3661F40LSH
In wordsminus four hundred and seventy-three billion, two hundred and seventy-five million, five hundred and six thousand, two hundred and fifty-seven
Ordinalminus four hundred and seventy-three billion, two hundred and seventy-five million, five hundred and six thousand, two hundred and fifty-seventh
Scientific notation-4.73275506 × 10^11
Engineering notation-473.275506 × 10^9

In other bases

Ternary1200020121101100202201222base 3; the most digit-efficient integer base after e: 25 digits
Quinary30223232012200012base 5; one hand: 17 digits
Septenary46123131266411base 7: 14 digits
Nonary1606541322658base 9; each digit is two ternary digits: 13 digits
Duodecimal77883014415base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimali9eibi5chbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal10:8:38:10:18:24:17base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT1100T1T11TT0TT0T1T01T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001011011010011100101010010011011110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111001000111001110100101001110000110101111
Bit length39 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits19within that length
Bit parityeven20 set bits, so even; not the same as the number itself being odd
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes56e 31 6b 1e 51
Gray code101100100101001110111101001000101111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111001000111001110100101001110000110101111two's complement
One's complement0000000000000000000000000110111000110001011010110001111001010000at 64 bits, every bit flipped
Bits reversed1111010110000111001010010111001110001001111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111110010001110011101001010011100001101011111at 64 bits, wrapping
Shifted left by 1-1101110001100010110101100011110010100010= -946,551,012,514, no wrap
Shifted right by 1-11011100011000101101011000111100101001= -236,637,753,128, discarding the low bit
These bits as a double2.33829169 × 10^-312IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+473,275,506,259
Nearest square below473,275,202,500
Nearest square above473,276,578,401

Powers & multiples

-473,275,506,257 to the power 2223,989,704,822,819,646,150,049
-473,275,506,257 to the power 3-106,008,840,946,375,962,517,870,041,460,356,593
-473,275,506,257 to the power 4501713878666138746501006002814… (47 digits)
-473,275,506,257 to the power 5-23744888992187988713366700334… (60 digits)
First ten multiples-473,275,506,257, -946,551,012,514, -1,419,826,518,771, -1,893,102,025,028, -2,366,377,531,285, -2,839,653,037,542, -3,312,928,543,799, -3,786,204,050,056, -4,259,479,556,313, -4,732,755,062,570
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)

Divisibility tests

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

As a percentage & fraction

As a percentage-47,327,550,625,700%
-473,275,506,257% as a decimal-4,732,755,062.57
-473,275,506,257% of 100-473,275,506,257
-473,275,506,257% of 1,000-4,732,755,062,570
As a fraction of 100-473,275,506,257/100

Keep nerding

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

Also reads as

473275506257 (identifier)

  • 12 characters
  • Checksum fails

473275506257 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right

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 “-473275506257” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.