Recognised as Number
-23,672,041,463,097
- Negative
- Odd
- Perfect cube
- 14 digits
-23,672,041,463,097 is an odd 14-digit integer and the negative of 23,672,041,463,097. It has 64 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value23,672,041,463,097
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, -28,713³
Factors & divisors
Prime factorisation−1 × 3^3 × 17^3 × 563^3
Distinct prime factors33, 17, 563
Number of divisors64
Sum of divisors σ(n)37,327,401,504,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 27, 51, 153, 289, 459, 563, 867, 1,689, 2,601, 4,913, 5,067, 7,803, 9,571, 14,739, 15,201, 28,713, 44,217, 86,139, 132,651, 162,707, 258,417, 316,969, 488,121, 950,907, 1,464,363, 2,766,019, 2,852,721, 4,393,089, 5,388,473, 8,298,057, 8,558,163, 16,165,419, 24,894,171, 48,496,257, 74,682,513, 91,604,041, 145,488,771, 178,453,547, 274,812,123, 535,360,641, 824,436,369, 1,557,268,697, 1,606,081,923, 2,473,309,107, 3,033,710,299, 4,671,806,091, 4,818,245,769, 9,101,130,897, 14,015,418,273, 27,303,392,691, 42,046,254,819, 51,573,075,083, 81,910,178,073, 154,719,225,249, 464,157,675,747, 876,742,276,411, 1,392,473,027,241, 2,630,226,829,233, 7,890,680,487,699, 23,672,041,463,09764 in total
Arithmetic
Previous number-23,672,041,463,098
Next number-23,672,041,463,096
Double-47,344,082,926,194
Square560,365,547,030,583,556,412,831,409
Cube-13,264,996,463,799,005,934,552,511,264,048,756,013,673
Cube root-28,713
Negation23,672,041,463,097
Reciprocal-4.22439274 × 10^-14≈
Representations
Decimal-23,672,041,463,097
Binary10101100001111001001110011111010111010011100145 bits
Octal530362347656471
Hexadecimal1587939F5D39
Base 368E2SAAJW9
In wordsminus twenty-three trillion, six hundred and seventy-two billion, forty-one million, four hundred and sixty-three thousand and ninety-seven
Ordinalminus twenty-three trillion, six hundred and seventy-two billion, forty-one million, four hundred and sixty-three thousand and ninety-seventh
Scientific notation-2.36720415 × 10^13
Engineering notation-23.672041 × 10^12
In other bases
Ternary10002211000200021022100101000base 3; the most digit-efficient integer base after e: 29 digits
Quinary11100320320103304342base 5; one hand: 20 digits
Septenary4662151153326066base 7: 16 digits
Nonary102730607270330base 9; each digit is two ternary digits: 15 digits
Duodecimal27a3972958b09base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal264dfcj2hehbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal8:27:22:26:24:33:4:57base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT00T01TT00T100T1TT01T00T0T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111111000100110111101101000011110011111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111010100111100001101100011000001010001011000111
Bit length45 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits19within that length
Bit parityeven26 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
Bytes615 87 93 9f 5d 39
Gray code111110100010001011010010100001111001110100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111010100111100001101100011000001010001011000111two's complement
One's complement0000000000000000000101011000011110010011100111110101110100111000at 64 bits, every bit flipped
Bits reversed1110001101000101000001100011011000011110010101111111111111111111at 64 bits
Rotated left by 11111111111111111110101001111000011011000110000010100010110001111at 64 bits, wrapping
Shifted left by 1-1010110000111100100111001111101011101001110010= -47,344,082,926,194, no wrap
Shifted right by 1-10101100001111001001110011111010111010011101= -11,836,020,731,548, discarding the low bit
These bits as a double1.16955425 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below23,672,039,313,664
Nearest square above23,672,049,044,449
Powers & multiples
-23,672,041,463,097 to the power 2560,365,547,030,583,556,412,831,409
-23,672,041,463,097 to the power 3-13264996463799005934552511264… (42 digits)
-23,672,041,463,097 to the power 4314009546298885151637898614568… (54 digits)
-23,672,041,463,097 to the power 5-74332469997954864262383702259… (68 digits)
First ten multiples-23,672,041,463,097, -47,344,082,926,194, -71,016,124,389,291, -94,688,165,852,388, -118,360,207,315,485, -142,032,248,778,582, -165,704,290,241,679, -189,376,331,704,776, -213,048,373,167,873, -236,720,414,630,970
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-2.36720415 × 10^15%
-23,672,041,463,097% as a decimal-236,720,414,630.97
-23,672,041,463,097% of 100-23,672,041,463,097
-23,672,041,463,097% of 1,000-236,720,414,630,970
As a fraction of 100-23,672,041,463,097/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -23,672,041,463,097
Also reads as
23672041463097 (identifier)
- 14 characters
- Checksum fails
23672041463097 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