Recognised as Number
-270,714,459,709
- Negative
- Odd
- Perfect cube
- 12 digits
-270,714,459,709 is an odd 12-digit integer and the negative of 270,714,459,709. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value270,714,459,709
Digit count12
Digit sum55
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -6,469³
Factors & divisors
Prime factorisation−1 × 6,469^3
Distinct prime factors16,469
Number of divisors4
Sum of divisors σ(n)270,756,314,140
SquarefreeNohas a repeated prime factor
All divisors1, 6,469, 41,847,961, 270,714,459,7094 in total
Arithmetic
Previous number-270,714,459,710
Next number-270,714,459,708
Double-541,428,919,418
Square73,286,318,695,535,784,364,681
Cube-19,839,666,169,723,555,534,560,146,737,137,829
Cube root-6,469
Negation270,714,459,709
Reciprocal-3.69392902 × 10^-12≈
Representations
Decimal-270,714,459,709
Binary1111110000011111010110110101100011110138 bits
Octal3740765553075
Hexadecimal3F07D6D63D
Base 363GD4EDZ1
In wordsminus two hundred and seventy billion, seven hundred and fourteen million, four hundred and fifty-nine thousand, seven hundred and nine
Ordinalminus two hundred and seventy billion, seven hundred and fourteen million, four hundred and fifty-nine thousand, seven hundred and ninth
Scientific notation-2.7071446 × 10^11
Engineering notation-270.71446 × 10^9
In other bases
Ternary221212202120000102211201base 3; the most digit-efficient integer base after e: 24 digits
Quinary13413410400202314base 5; one hand: 17 digits
Septenary25362361640401base 7: 14 digits
Nonary855676012751base 9; each digit is two ternary digits: 12 digits
Duodecimal44571884591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalab9i57959base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal5:48:8:27:41:1:49base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT0010101T0110000TT001110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000100001000011110010111111011000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111100000011111000001010010010100111000011
Bit length38 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits14within that length
Bit parityeven24 set bits, so even; not the same as the number itself being odd
Highest set bitbit 37worth 137,438,953,472
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes53f 07 d6 d6 3d
Gray code10000010000100001111011011110100100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111100000011111000001010010010100111000011two's complement
One's complement0000000000000000000000000011111100000111110101101101011000111100at 64 bits, every bit flipped
Bits reversed1100001110010100100101000001111100000011111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111000000111110000010100100101001110000111at 64 bits, wrapping
Shifted left by 1-111111000001111101011011010110001111010= -541,428,919,418, no wrap
Shifted right by 1-1111110000011111010110110101100011111= -135,357,229,854, discarding the low bit
These bits as a double1.33750714 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-270,714,459,709 to the power 273,286,318,695,535,784,364,681
-270,714,459,709 to the power 3-19,839,666,169,723,555,534,560,146,737,137,829
-270,714,459,709 to the power 4537088450794363783042890680090… (46 digits)
-270,714,459,709 to the power 5-14539760977274002338885344643… (59 digits)
First ten multiples-270,714,459,709, -541,428,919,418, -812,143,379,127, -1,082,857,838,836, -1,353,572,298,545, -1,624,286,758,254, -1,895,001,217,963, -2,165,715,677,672, -2,436,430,137,381, -2,707,144,597,090
Powers of twoBetween 2^37 (137,438,953,472) and 2^38 (274,877,906,944)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-27,071,445,970,900%
-270,714,459,709% as a decimal-2,707,144,597.09
-270,714,459,709% of 100-270,714,459,709
-270,714,459,709% of 1,000-2,707,144,597,090
As a fraction of 100-270,714,459,709/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -270,714,459,709
Also reads as
270714459709 (identifier)
- 12 characters
- Checksum fails
270714459709 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.
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