Recognised as Number
-10,848,165,325,353
- Negative
- Odd
- Perfect cube
- 14 digits
-10,848,165,325,353 is an odd 14-digit integer and the negative of 10,848,165,325,353. It has 64 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,848,165,325,353
Digit count14
Digit sum54
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -22,137³
Factors & divisors
Prime factorisation−1 × 3^3 × 47^3 × 157^3
Distinct prime factors33, 47, 157
Number of divisors64
Sum of divisors σ(n)16,525,991,040,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 47, 141, 157, 423, 471, 1,269, 1,413, 2,209, 4,239, 6,627, 7,379, 19,881, 22,137, 24,649, 59,643, 66,411, 73,947, 103,823, 199,233, 221,841, 311,469, 346,813, 665,523, 934,407, 1,040,439, 1,158,503, 2,803,221, 3,121,317, 3,475,509, 3,869,893, 9,363,951, 10,426,527, 11,609,679, 16,300,211, 31,279,581, 34,829,037, 48,900,633, 54,449,641, 104,487,111, 146,701,899, 163,348,923, 181,884,971, 440,105,697, 490,046,769, 545,654,913, 1,470,140,307, 1,636,964,739, 2,559,133,127, 4,910,894,217, 7,677,399,381, 8,548,593,637, 23,032,198,143, 25,645,780,911, 69,096,594,429, 76,937,342,733, 230,812,028,199, 401,783,900,939, 1,205,351,702,817, 3,616,055,108,451, 10,848,165,325,35364 in total
Arithmetic
Previous number-10,848,165,325,354
Next number-10,848,165,325,352
Double-21,696,330,650,706
Square117,682,690,926,191,160,344,574,609
Cube-1,276,641,287,099,741,069,868,474,804,830,867,761,977
Cube root-22,137
Negation10,848,165,325,353
Reciprocal-9.2181486 × 10^-14≈
Representations
Decimal-10,848,165,325,353
Binary1001110111011100100100001010011010100010100144 bits
Octal235671102465051
Hexadecimal9DDC90A6A29
Base 363UFKTJK89
In wordsminus ten trillion, eight hundred and forty-eight billion, one hundred and sixty-five million, three hundred and twenty-five thousand, three hundred and fifty-three
Ordinalminus ten trillion, eight hundred and forty-eight billion, one hundred and sixty-five million, three hundred and twenty-five thousand, three hundred and fifty-third
Scientific notation-1.08481653 × 10^13
Engineering notation-10.848165 × 10^12
In other bases
Ternary1102102002000021221000222000base 3; the most digit-efficient integer base after e: 28 digits
Quinary2410214020310402403base 5; one hand: 19 digits
Septenary2166516435556356base 7: 16 digits
Nonary42362007830860base 9; each digit is two ternary digits: 14 digits
Duodecimal1272544750209base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal113f2bd5d7dbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal3:52:30:49:47:37:2:33base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryTTT1TT10T1000T0101T00T001000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100110011001001011000010101110101000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111101100010001000110110111101011001010111010111
Bit length44 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits23within that length
Bit parityodd21 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
Bytes609 dd c9 0a 6a 29
Gray code11010011001100101101100011110101111100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111101100010001000110110111101011001010111010111two's complement
One's complement0000000000000000000010011101110111001001000010100110101000101000at 64 bits, every bit flipped
Bits reversed1110101110101001101011110110110001000100011011111111111111111111at 64 bits
Rotated left by 11111111111111111111011000100010001101101111010110010101110101111at 64 bits, wrapping
Shifted left by 1-100111011101110010010000101001101010001010010= -21,696,330,650,706, no wrap
Shifted right by 1-1001110111011100100100001010011010100010101= -5,424,082,662,676, discarding the low bit
These bits as a double5.35970581 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below10,848,163,259,025
Nearest square above10,848,169,846,336
Powers & multiples
-10,848,165,325,353 to the power 2117,682,690,926,191,160,344,574,609
-10,848,165,325,353 to the power 3-12766412870997410698684748048… (41 digits)
-10,848,165,325,353 to the power 4138492157436294352649717992860… (53 digits)
-10,848,165,325,353 to the power 5-15023858201337370244830045076… (67 digits)
First ten multiples-10,848,165,325,353, -21,696,330,650,706, -32,544,495,976,059, -43,392,661,301,412, -54,240,826,626,765, -65,088,991,952,118, -75,937,157,277,471, -86,785,322,602,824, -97,633,487,928,177, -108,481,653,253,530
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 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-1.08481653 × 10^15%
-10,848,165,325,353% as a decimal-108,481,653,253.53
-10,848,165,325,353% of 100-10,848,165,325,353
-10,848,165,325,353% of 1,000-108,481,653,253,530
As a fraction of 100-10,848,165,325,353/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -10,848,165,325,353
Also reads as
10848165325353 (identifier)
- 14 characters
- Checksum fails
10848165325353 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