Recognised as Number
-4,299,735,587,581
- Negative
- Odd
- Perfect cube
- 13 digits
-4,299,735,587,581 is an odd 13-digit integer and the negative of 4,299,735,587,581. It has 64 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value4,299,735,587,581
Digit count13
Digit sum73
Digit product762,048,000
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -16,261³
Factors & divisors
Prime factorisation−1 × 7^3 × 23^3 × 101^3
Distinct prime factors37, 23, 101
Number of divisors64
Sum of divisors σ(n)5,294,593,152,000
SquarefreeNohas a repeated prime factor
All divisors1, 7, 23, 49, 101, 161, 343, 529, 707, 1,127, 2,323, 3,703, 4,949, 7,889, 10,201, 12,167, 16,261, 25,921, 34,643, 53,429, 71,407, 85,169, 113,827, 181,447, 234,623, 374,003, 499,849, 596,183, 796,789, 1,030,301, 1,228,867, 1,642,361, 2,618,021, 3,498,943, 4,173,281, 5,396,329, 7,212,107, 8,602,069, 11,496,527, 18,326,147, 23,696,923, 37,774,303, 50,484,749, 60,214,483, 80,475,689, 124,115,567, 165,878,461, 264,420,121, 353,393,243, 421,501,381, 545,029,229, 868,808,969, 1,161,149,227, 1,850,940,847, 3,815,204,603, 6,081,662,783, 8,128,044,589, 12,535,672,267, 26,706,432,221, 42,571,639,481, 87,749,705,869, 186,945,025,547, 614,247,941,083, 4,299,735,587,58164 in total
Arithmetic
Previous number-4,299,735,587,582
Next number-4,299,735,587,580
Double-8,599,471,175,162
Square18,487,726,123,110,527,321,431,561
Cube-79,492,333,944,989,246,335,822,286,990,413,043,941
Cube root-16,261
Negation4,299,735,587,581
Reciprocal-2.32572441 × 10^-13≈
Representations
Decimal-4,299,735,587,581
Binary11111010010001110000110110010110101111110142 bits
Octal76443415455375
Hexadecimal3E91C365AFD
Base 361IV9RJWN1
In wordsminus four trillion, two hundred and ninety-nine billion, seven hundred and thirty-five million, five hundred and eighty-seven thousand, five hundred and eighty-one
Ordinalminus four trillion, two hundred and ninety-nine billion, seven hundred and thirty-five million, five hundred and eighty-seven thousand, five hundred and eighty-first
Scientific notation-4.29973559 × 10^12
Engineering notation-4.299736 × 10^12
In other bases
Ternary120020001100222002012000201base 3; the most digit-efficient integer base after e: 27 digits
Quinary1030421324302300311base 5; one hand: 19 digits
Septenary622434312316000base 7: 15 digits
Nonary16201328065021base 9; each digit is two ternary digits: 14 digits
Duodecimal5953988b9591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal87j37788j1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:32:9:29:43:16:33:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT110T1000TT0T0010T1T1100T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110101100100100110111101110010100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111000001011011100011110010011010010100000011
Bit length42 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits17within that length
Bit parityodd25 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 41worth 2,199,023,255,552
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes603 e9 1c 36 5a fd
Gray code100001110110010010001011010111011110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111000001011011100011110010011010010100000011two's complement
One's complement0000000000000000000000111110100100011100001101100101101011111100at 64 bits, every bit flipped
Bits reversed1100000010100101100100111100011101101000001111111111111111111111at 64 bits
Rotated left by 11111111111111111111110000010110111000111100100110100101000000111at 64 bits, wrapping
Shifted left by 1-1111101001000111000011011001011010111111010= -8,599,471,175,162, no wrap
Shifted right by 1-11111010010001110000110110010110101111111= -2,149,867,793,790, discarding the low bit
These bits as a double2.12435164 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below4,299,734,016,400
Nearest square above4,299,738,163,561
Powers & multiples
-4,299,735,587,581 to the power 218,487,726,123,110,527,321,431,561
-4,299,735,587,581 to the power 3-79,492,333,944,989,246,335,822,286,990,413,043,941
-4,299,735,587,581 to the power 4341796017203143408824483192401… (51 digits)
-4,299,735,587,581 to the power 5-14696324988618034091821465397… (65 digits)
First ten multiples-4,299,735,587,581, -8,599,471,175,162, -12,899,206,762,743, -17,198,942,350,324, -21,498,677,937,905, -25,798,413,525,486, -30,098,149,113,067, -34,397,884,700,648, -38,697,620,288,229, -42,997,355,875,810
Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-429,973,558,758,100%
-4,299,735,587,581% as a decimal-42,997,355,875.81
-4,299,735,587,581% of 100-4,299,735,587,581
-4,299,735,587,581% of 1,000-42,997,355,875,810
As a fraction of 100-4,299,735,587,581/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -4,299,735,587,581
Also reads as
4299735587581 (identifier)
- 13 characters
- Checksum fails
4299735587581 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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