Recognised as Number
-444,355,560,001
- Negative
- Odd
- 12 digits
-444,355,560,001 is an odd 12-digit integer and the negative of 444,355,560,001. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value444,355,560,001
Digit count12
Digit sum37
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
Factors & divisors
Prime factorisation−1 × 17 × 4,373 × 5,977,261
Distinct prime factors317, 4,373, 5,977,261
Number of divisors8
Sum of divisors σ(n)470,601,791,784
SquarefreeYesno repeated prime factor
All divisors1, 17, 4,373, 74,341, 5,977,261, 101,613,437, 26,138,562,353, 444,355,560,0018 in total
Arithmetic
Previous number-444,355,560,002
Next number-444,355,560,000
Double-888,711,120,002
Square197,451,863,703,802,311,120,001
Cube-87,738,833,469,344,201,950,726,073,866,680,001
Cube root-7,630.919513329≈
Negation444,355,560,001
Reciprocal-2.25045007 × 10^-12≈
Representations
Decimal-444,355,560,001
Binary11001110111010110100111110000100100000139 bits
Octal6356551741101
Hexadecimal6775A7C241
Base 365O4TTSG1
In wordsminus four hundred and forty-four billion, three hundred and fifty-five million, five hundred and sixty thousand and one
Ordinalminus four hundred and forty-four billion, three hundred and fifty-five million, five hundred and sixty thousand and first
Scientific notation-4.4435556 × 10^11
Engineering notation-444.35556 × 10^9
In other bases
Ternary1120110221220101021120101base 3; the most digit-efficient integer base after e: 25 digits
Quinary24240020010410001base 5; one hand: 17 digits
Septenary44050354640323base 7: 14 digits
Nonary1513856337511base 9; each digit is two ternary digits: 13 digits
Duodecimal72151940401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalh73125001base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal9:31:26:41:40:0:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT1110TTT001010T0TT01110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110100110011111101010000100001011000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111001100010001010010110000011110110111111
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
Bytes567 75 a7 c2 41
Gray code101010011001111011101000010001101100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111001100010001010010110000011110110111111two's complement
One's complement0000000000000000000000000110011101110101101001111100001001000000at 64 bits, every bit flipped
Bits reversed1111110110111100000110100101000100011001111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111110011000100010100101100000111101101111111at 64 bits, wrapping
Shifted left by 1-1100111011101011010011111000010010000010= -888,711,120,002, no wrap
Shifted right by 1-11001110111010110100111110000100100001= -222,177,780,000, discarding the low bit
These bits as a double2.19540817 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-444,355,560,001 to the power 2197,451,863,703,802,311,120,001
-444,355,560,001 to the power 3-87,738,833,469,344,201,950,726,073,866,680,001
-444,355,560,001 to the power 4389872384801049245240373211615… (47 digits)
-444,355,560,001 to the power 5-17324196187719559834116442230… (60 digits)
First ten multiples-444,355,560,001, -888,711,120,002, -1,333,066,680,003, -1,777,422,240,004, -2,221,777,800,005, -2,666,133,360,006, -3,110,488,920,007, -3,554,844,480,008, -3,999,200,040,009, -4,443,555,600,010
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-44,435,556,000,100%
-444,355,560,001% as a decimal-4,443,555,600.01
-444,355,560,001% of 100-444,355,560,001
-444,355,560,001% of 1,000-4,443,555,600,010
As a fraction of 100-444,355,560,001/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -444,355,560,001
Also reads as
444355560001 (identifier)
- 12 characters
- Checksum fails
444355560001 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