Recognised as Number
743,392,288,804
- Positive
- Even
- Composite
- Perfect square
- 12 digits
743,392,288,804 is an even 12-digit integer and a composite number. It has 27 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value743,392,288,804
Digit count12
Digit sum58
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 862,202²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 11^2 × 39,191^2
Distinct prime factors32, 11, 39,191
Number of divisors27
Sum of divisors σ(n)1,429,991,489,563
Aliquot sum686,599,200,759sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)337,896,963,800integers below n that share no factor with it
Carmichael function λ(n)16,894,848,190the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 337,896,963,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 121, 242, 484, 39,191, 78,382, 156,764, 431,101, 862,202, 1,724,404, 4,742,111, 9,484,222, 18,968,444, 1,535,934,481, 3,071,868,962, 6,143,737,924, 16,895,279,291, 33,790,558,582, 67,581,117,164, 185,848,072,201, 371,696,144,402, 743,392,288,80427 in total
Arithmetic
Previous number743,392,288,803
Next number743,392,288,805
Double1,486,784,577,608
Half371,696,144,402
Square552,632,095,053,249,743,750,416
Cube410,822,438,008,185,013,264,848,245,167,142,464
Square root862,202exact
Cube root9,058.841978815≈
Negation-743,392,288,804
Reciprocal1.34518479 × 10^-12≈
Representations
Decimal743,392,288,804
Binary101011010001010110100010001000000010010040 bits
Octal12642550420044
HexadecimalAD15A22024
Base 369HICKP44
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and forty-three billion, three hundred and ninety-two million, two hundred and eighty-eight thousand, eight hundred and four
Ordinalseven hundred and forty-three billion, three hundred and ninety-two million, two hundred and eighty-eight thousand, eight hundred and fourth
Scientific notation7.43392289 × 10^11
Engineering notation743.392289 × 10^9
In other bases
Ternary2122001211021202001122111base 3; the most digit-efficient integer base after e: 25 digits
Quinary44134431411220204base 5; one hand: 17 digits
Septenary104464645124104base 7: 15 digits
Nonary2561737661574base 9; each digit is two ternary digits: 13 digits
Duodecimal1000a86a6a04base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal190fa1g204base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal15:56:0:30:58:0:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T0T01TT1110TT1T01TT0T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110101101010111001100110000001100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001010110100010101101000100010000000100100
Bit length40 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits26within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes5ad 15 a2 20 24
Gray code1111101110011111011100110011000000110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001010110100010101101000100010000000100100
One's complement1111111111111111111111110101001011101010010111011101111111011011at 64 bits, every bit flipped
Bits reversed0010010000000100010001011010100010110101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101101000101011010001000100000001001000at 64 bits, wrapping
Shifted left by 110101101000101011010001000100000001001000= 1,486,784,577,608, no wrap
Shifted right by 1101011010001010110100010001000000010010= 371,696,144,402, discarding the low bit
These bits as a double3.67284591 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
743,392,288,804 to the power 2552,632,095,053,249,743,750,416
743,392,288,804 to the power 3410,822,438,008,185,013,264,848,245,167,142,464
743,392,288,804 to the power 4305402232482944059896846637612… (48 digits)
743,392,288,804 to the power 5227033664611347100579012890076… (60 digits)
First ten multiples743,392,288,804, 1,486,784,577,608, 2,230,176,866,412, 2,973,569,155,216, 3,716,961,444,020, 4,460,353,732,824, 5,203,746,021,628, 5,947,138,310,432, 6,690,530,599,236, 7,433,922,888,040
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached940,855,865,5241× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps743,392,288,804 → 371,696,144,402 → 185,848,072,201 → 557,544,216,604 → 278,772,108,302 → 139,386,054,151 → 418,158,162,454 → 209,079,081,227 → 627,237,243,682 → 313,618,621,841 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage74,339,228,880,400%
743,392,288,804% as a decimal7,433,922,888.04
743,392,288,804% of 100743,392,288,804
743,392,288,804% of 1,0007,433,922,888,040
As a fraction of 100743,392,288,804/100
Read another way
As seconds23,556 years, 248 days and 10 hours
As bytes692.338 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 743,392,288,804
Nearby primes
Also reads as
743392288804 (identifier)
- 12 characters
- Checksum valid
743392288804 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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