Recognised as Number
-16,712,418,959,265
- Negative
- Odd
- 14 digits
-16,712,418,959,265 is an odd 14-digit integer and the negative of 16,712,418,959,265. It has 64 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,712,418,959,265
Digit count14
Digit sum66
Digit product65,318,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5 × 107 × 283 × 739 × 49,789
Distinct prime factors63, 5, 107, 283, 739, 49,789
Number of divisors64
Sum of divisors σ(n)27,122,341,708,800
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 107, 283, 321, 535, 739, 849, 1,415, 1,605, 2,217, 3,695, 4,245, 11,085, 30,281, 49,789, 79,073, 90,843, 149,367, 151,405, 209,137, 237,219, 248,945, 395,365, 454,215, 627,411, 746,835, 1,045,685, 1,186,095, 3,137,055, 5,327,423, 14,090,287, 15,982,269, 22,377,659, 26,637,115, 36,794,071, 42,270,861, 67,132,977, 70,451,435, 79,911,345, 110,382,213, 111,888,295, 183,970,355, 211,354,305, 335,664,885, 551,911,065, 1,507,660,709, 3,936,965,597, 4,522,982,127, 7,538,303,545, 10,412,722,093, 11,810,896,791, 19,684,827,985, 22,614,910,635, 31,238,166,279, 52,063,610,465, 59,054,483,955, 156,190,831,395, 1,114,161,263,951, 3,342,483,791,853, 5,570,806,319,755, 16,712,418,959,26564 in total
Arithmetic
Previous number-16,712,418,959,266
Next number-16,712,418,959,264
Double-33,424,837,918,530
Square279,304,947,470,000,225,729,340,225
Cube-4,667,861,299,514,146,667,292,855,238,669,600,934,625
Cube root-25,567.000000001≈
Negation16,712,418,959,265
Reciprocal-5.98357427 × 10^-14≈
Representations
Decimal-16,712,418,959,265
Binary1111001100110010100111001011100111111010000144 bits
Octal363145162717641
HexadecimalF3329CB9FA1
Base 365X9KUQVFL
In wordsminus sixteen trillion, seven hundred and twelve billion, four hundred and eighteen million, nine hundred and fifty-nine thousand, two hundred and sixty-five
Ordinalminus sixteen trillion, seven hundred and twelve billion, four hundred and eighteen million, nine hundred and fifty-nine thousand, two hundred and sixty-fifth
Scientific notation-1.6712419 × 10^13
Engineering notation-16.712419 × 10^12
In other bases
Ternary2012011200200012201200212210base 3; the most digit-efficient integer base after e: 28 digits
Quinary4142304013223144030base 5; one hand: 19 digits
Septenary3343301215163361base 7: 16 digits
Nonary65150605650783base 9; each digit is two ternary digits: 14 digits
Duodecimal1a5ab8b3656a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1ccgbai9i35base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal5:58:12:18:29:59:47:45base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT1T11T1110T100T101T110T0101T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011101110100101010011101011010000110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111100001100110011010110001101000110000001011111
Bit length44 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits19within that length
Bit parityodd25 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes60f 33 29 cb 9f a1
Gray code10001010101010111101001011100101000001110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111100001100110011010110001101000110000001011111two's complement
One's complement0000000000000000000011110011001100101001110010111001111110100000at 64 bits, every bit flipped
Bits reversed1111101000000110001011000110101100110011000011111111111111111111at 64 bits
Rotated left by 11111111111111111111000011001100110101100011010001100000010111111at 64 bits, wrapping
Shifted left by 1-111100110011001010011100101110011111101000010= -33,424,837,918,530, no wrap
Shifted right by 1-1111001100110010100111001011100111111010001= -8,356,209,479,632, discarding the low bit
These bits as a double8.25703207 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below16,712,414,438,724
Nearest square above16,712,422,614,889
Powers & multiples
-16,712,418,959,265 to the power 2279,304,947,470,000,225,729,340,225
-16,712,418,959,265 to the power 3-46678612995141466672928552386… (41 digits)
-16,712,418,959,265 to the power 4780112536812195854955430279628… (53 digits)
-16,712,418,959,265 to the power 5-13037567550580457251033579006… (68 digits)
First ten multiples-16,712,418,959,265, -33,424,837,918,530, -50,137,256,877,795, -66,849,675,837,060, -83,562,094,796,325, -100,274,513,755,590, -116,986,932,714,855, -133,699,351,674,120, -150,411,770,633,385, -167,124,189,592,650
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-1.6712419 × 10^15%
-16,712,418,959,265% as a decimal-167,124,189,592.65
-16,712,418,959,265% of 100-16,712,418,959,265
-16,712,418,959,265% of 1,000-167,124,189,592,650
As a fraction of 100-16,712,418,959,265/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -16,712,418,959,265
Also reads as
16712418959265 (identifier)
- 14 characters
- Checksum fails
16712418959265 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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-14 (case/carton)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