Recognised as Number
-25,461,484,367,059
- Negative
- Odd
- Perfect cube
- 14 digits
-25,461,484,367,059 is an odd 14-digit integer and the negative of 25,461,484,367,059. It has 64 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value25,461,484,367,059
Digit count14
Digit sum64
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, -29,419³
Factors & divisors
Prime factorisation−1 × 13^3 × 31^3 × 73^3
Distinct prime factors313, 31, 73
Number of divisors64
Sum of divisors σ(n)28,897,544,166,400
SquarefreeNohas a repeated prime factor
All divisors1, 13, 31, 73, 169, 403, 949, 961, 2,197, 2,263, 5,239, 5,329, 12,337, 12,493, 29,419, 29,791, 68,107, 69,277, 70,153, 160,381, 162,409, 165,199, 382,447, 387,283, 389,017, 900,601, 911,989, 2,111,317, 2,147,587, 2,174,743, 4,971,811, 5,034,679, 5,057,221, 5,121,169, 11,707,813, 11,855,857, 12,059,527, 27,918,631, 28,271,659, 65,450,827, 65,743,873, 66,575,197, 154,126,141, 156,773,851, 158,756,239, 362,942,203, 367,531,567, 373,845,337, 854,670,349, 865,477,561, 2,038,060,063, 2,063,831,107, 4,777,910,371, 4,859,989,381, 11,251,208,293, 11,589,205,447, 26,494,780,819, 26,829,804,391, 63,179,861,953, 150,659,670,811, 348,787,457,083, 821,338,205,389, 1,958,575,720,543, 25,461,484,367,05964 in total
Arithmetic
Previous number-25,461,484,367,060
Next number-25,461,484,367,058
Double-50,922,968,734,118
Square648,287,186,173,989,845,844,309,481
Cube-16,506,354,056,133,709,945,965,891,167,296,197,786,379
Cube root-29,419
Negation25,461,484,367,059
Reciprocal-3.92750079 × 10^-14≈
Representations
Decimal-25,461,484,367,059
Binary10111001010000011011010111011001011001101001145 bits
Octal562406656626323
Hexadecimal172836BB2CD3
Base 3690WUEE9CJ
In wordsminus twenty-five trillion, four hundred and sixty-one billion, four hundred and eighty-four million, three hundred and sixty-seven thousand and fifty-nine
Ordinalminus twenty-five trillion, four hundred and sixty-one billion, four hundred and eighty-four million, three hundred and sixty-seven thousand and fifty-ninth
Scientific notation-2.54614844 × 10^13
Engineering notation-25.461484 × 10^12
In other bases
Ternary10100011002112121211110121201base 3; the most digit-efficient integer base after e: 29 digits
Quinary11314130104444221214base 5; one hand: 20 digits
Septenary5235350214130366base 7: 16 digits
Nonary110132477743551base 9; each digit is two ternary digits: 15 digits
Duodecimal2a32733721017base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal29ebfdh5hcjbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal9:5:43:40:42:26:24:19base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT0T000TT0T01101011TTTTT10110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110010010100011011001010001011101011101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111010001101011111001001010001001101001100101101
Bit length45 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits21within that length
Bit parityeven24 set bits, so even; not the same as the number itself being odd
Highest set bitbit 44worth 17,592,186,044,416
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes617 28 36 bb 2c d3
Gray code111001011110000101101111001101011101010111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111010001101011111001001010001001101001100101101two's complement
One's complement0000000000000000000101110010100000110110101110110010110011010010at 64 bits, every bit flipped
Bits reversed1011010011001011001000101001001111101011000101111111111111111111at 64 bits
Rotated left by 11111111111111111110100011010111110010010100010011010011001011011at 64 bits, wrapping
Shifted left by 1-1011100101000001101101011101100101100110100110= -50,922,968,734,118, no wrap
Shifted right by 1-10111001010000011011010111011001011001101010= -12,730,742,183,529, discarding the low bit
These bits as a double1.25796447 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below25,461,480,207,969
Nearest square above25,461,490,299,844
Powers & multiples
-25,461,484,367,059 to the power 2648,287,186,173,989,845,844,309,481
-25,461,484,367,059 to the power 3-16506354056133709945965891167… (42 digits)
-25,461,484,367,059 to the power 4420276275757389371140234841558… (54 digits)
-25,461,484,367,059 to the power 5-10700857825042546858288736355… (69 digits)
First ten multiples-25,461,484,367,059, -50,922,968,734,118, -76,384,453,101,177, -101,845,937,468,236, -127,307,421,835,295, -152,768,906,202,354, -178,230,390,569,413, -203,691,874,936,472, -229,153,359,303,531, -254,614,843,670,590
Powers of twoBetween 2^44 (17,592,186,044,416) and 2^45 (35,184,372,088,832)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-2.54614844 × 10^15%
-25,461,484,367,059% as a decimal-254,614,843,670.59
-25,461,484,367,059% of 100-25,461,484,367,059
-25,461,484,367,059% of 1,000-254,614,843,670,590
As a fraction of 100-25,461,484,367,059/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -25,461,484,367,059
Also reads as
25461484367059 (identifier)
- 14 characters
- Checksum fails
25461484367059 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