Recognised as Number
378,432,898,561
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
378,432,898,561 is an odd 12-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value378,432,898,561
Digit count12
Digit sum64
Digit product69,672,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 615,169²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation503^2 × 1,223^2
Distinct prime factors2503, 1,223
Number of divisors9
Sum of divisors σ(n)379,497,045,889
Aliquot sum1,064,147,328sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)377,371,732,036integers below n that share no factor with it
Carmichael function λ(n)188,685,866,018the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 377,371,732,036
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 503, 1,223, 253,009, 615,169, 1,495,729, 309,430,007, 752,351,687, 378,432,898,5619 in total
Arithmetic
Previous number378,432,898,560
Next number378,432,898,562
Double756,865,797,122
Square143,211,458,713,280,115,870,721
Cube54,195,927,428,015,573,672,882,886,382,932,481
Square root615,169exact
Cube root7,233.185917073≈
Negation-378,432,898,561
Reciprocal2.64247639 × 10^-12≈
Representations
Decimal378,432,898,561
Binary10110000001110001011011110001100000000139 bits
Octal5403426743001
Hexadecimal581C5BC601
Base 364TUL6DC1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree hundred and seventy-eight billion, four hundred and thirty-two million, eight hundred and ninety-eight thousand, five hundred and sixty-one
Ordinalthree hundred and seventy-eight billion, four hundred and thirty-two million, eight hundred and ninety-eight thousand, five hundred and sixty-first
Scientific notation3.78432899 × 10^11
Engineering notation378.432899 × 10^9
In other bases
Ternary1100011210122021002201001base 3; the most digit-efficient integer base after e: 25 digits
Quinary22200012310223221base 5; one hand: 17 digits
Septenary36224630364154base 7: 14 digits
Nonary1304718232631base 9; each digit is two ternary digits: 13 digits
Duodecimal614144b4001base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalefd05c681base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal8:6:40:4:9:36:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11001TTT11T0T1T1010T01001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100001101101101011001101101000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000101100000011100010110111100011000000001
Bit length39 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits23within that length
Bit parityeven16 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
Bytes558 1c 5b c6 01
Gray code111010000010010011101100010010100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000101100000011100010110111100011000000001
One's complement1111111111111111111111111010011111100011101001000011100111111110at 64 bits, every bit flipped
Bits reversed1000000001100011110110100011100000011010000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001011000000111000101101111000110000000010at 64 bits, wrapping
Shifted left by 11011000000111000101101111000110000000010= 756,865,797,122, no wrap
Shifted right by 110110000001110001011011110001100000000= 189,216,449,280, discarding the low bit
These bits as a double1.86970694 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
378,432,898,561 to the power 2143,211,458,713,280,115,870,721
378,432,898,561 to the power 354,195,927,428,015,573,672,882,886,382,932,481
378,432,898,561 to the power 4205095219067855352212783115389… (47 digits)
378,432,898,561 to the power 5776147782328517774797610795938… (58 digits)
First ten multiples378,432,898,561, 756,865,797,122, 1,135,298,695,683, 1,513,731,594,244, 1,892,164,492,805, 2,270,597,391,366, 2,649,030,289,927, 3,027,463,188,488, 3,405,896,087,049, 3,784,328,985,610
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached1,135,298,695,6843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps378,432,898,561 → 1,135,298,695,684 → 567,649,347,842 → 283,824,673,921 → 851,474,021,764 → 425,737,010,882 → 212,868,505,441 → 638,605,516,324 → 319,302,758,162 → 159,651,379,081 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage37,843,289,856,100%
378,432,898,561% as a decimal3,784,328,985.61
378,432,898,561% of 100378,432,898,561
378,432,898,561% of 1,0003,784,328,985,610
As a fraction of 100378,432,898,561/100
Read another way
As seconds11,991 years, 297 days and 15 hours
As bytes352.443 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 378,432,898,561
Nearby primes
Also reads as
378432898561 (identifier)
- 12 characters
- Checksum fails
378432898561 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