Recognised as Number
748,628,144,289
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
748,628,144,289 is an odd 12-digit integer and a composite number. It has 15 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value748,628,144,289
Digit count12
Digit sum63
Digit product49,545,216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 865,233²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 96,137^2
Distinct prime factors23, 96,137
Number of divisors15
Sum of divisors σ(n)1,118,332,687,747
Aliquot sum369,704,543,458sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)499,080,238,128integers below n that share no factor with it
Carmichael function λ(n)249,540,119,064the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 499,080,238,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 96,137, 288,411, 865,233, 2,595,699, 7,787,097, 9,242,322,769, 27,726,968,307, 83,180,904,921, 249,542,714,763, 748,628,144,28915 in total
Arithmetic
Previous number748,628,144,288
Next number748,628,144,290
Double1,497,256,288,578
Square560,444,098,421,591,803,315,521
Cube419,564,225,379,077,945,685,551,563,781,209,569
Square root865,233exact
Cube root9,080.059967005≈
Negation-748,628,144,289
Reciprocal1.33577666 × 10^-12≈
Representations
Decimal748,628,144,289
Binary101011100100110110110110111100001010000140 bits
Octal12711555570241
HexadecimalAE4DB6F0A1
Base 369JWXV929
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and forty-eight billion, six hundred and twenty-eight million, one hundred and forty-four thousand, two hundred and eighty-nine
Ordinalseven hundred and forty-eight billion, six hundred and twenty-eight million, one hundred and forty-four thousand, two hundred and eighty-ninth
Scientific notation7.48628144 × 10^11
Engineering notation748.628144 × 10^9
In other bases
Ternary2122120100011221002010000base 3; the most digit-efficient integer base after e: 25 digits
Quinary44231142301104124base 5; one hand: 17 digits
Septenary105041463142644base 7: 15 digits
Nonary2576304832100base 9; each digit is two ternary digits: 13 digits
Duodecimal10110a073969base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal194h65i0e9base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal16:2:44:31:2:18:9base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T00TT01001TT0T101T010000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111001001010010110010110011000111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001010111001001101101101101111000010100001
Bit length40 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits19within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes5ae 4d b6 f0 a1
Gray code1111100101101011011011011000100011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001010111001001101101101101111000010100001
One's complement1111111111111111111111110101000110110010010010010000111101011110at 64 bits, every bit flipped
Bits reversed1000010100001111011011011011001001110101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101110010011011011011011110000101000010at 64 bits, wrapping
Shifted left by 110101110010011011011011011110000101000010= 1,497,256,288,578, no wrap
Shifted right by 1101011100100110110110110111100001010000= 374,314,072,144, discarding the low bit
These bits as a double3.69871448 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
748,628,144,289 to the power 2560,444,098,421,591,803,315,521
748,628,144,289 to the power 3419,564,225,379,077,945,685,551,563,781,209,569
748,628,144,289 to the power 4314097587455590880044460801112… (48 digits)
748,628,144,289 to the power 5235142294022530885725677091350… (60 digits)
First ten multiples748,628,144,289, 1,497,256,288,578, 2,245,884,432,867, 2,994,512,577,156, 3,743,140,721,445, 4,491,768,865,734, 5,240,397,010,023, 5,989,025,154,312, 6,737,653,298,601, 7,486,281,442,890
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1399the total stopping time
Highest value reached3,197,753,421,0284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps748,628,144,289 → 2,245,884,432,868 → 1,122,942,216,434 → 561,471,108,217 → 1,684,413,324,652 → 842,206,662,326 → 421,103,331,163 → 1,263,309,993,490 → 631,654,996,745 → 1,894,964,990,236 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage74,862,814,428,900%
748,628,144,289% as a decimal7,486,281,442.89
748,628,144,289% of 100748,628,144,289
748,628,144,289% of 1,0007,486,281,442,890
As a fraction of 100748,628,144,289/100
Read another way
As seconds23,722 years, 217 days and 2 hours
As bytes697.214 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 748,628,144,289
Nearby primes
Also reads as
748628144289 (identifier)
- 12 characters
- Checksum fails
748628144289 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