Recognised as Number
728,731,980,964
- Positive
- Even
- Composite
- Perfect square
- 12 digits
728,731,980,964 is an even 12-digit integer and a composite number. It has 27 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value728,731,980,964
Digit count12
Digit sum64
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 853,658²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 13^2 × 32,833^2
Distinct prime factors32, 13, 32,833
Number of divisors27
Sum of divisors σ(n)1,380,967,604,163
Aliquot sum652,235,623,199sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)336,327,593,472integers below n that share no factor with it
Carmichael function λ(n)14,013,649,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 336,327,593,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 169, 338, 676, 32,833, 65,666, 131,332, 426,829, 853,658, 1,707,316, 5,548,777, 11,097,554, 22,195,108, 1,078,005,889, 2,156,011,778, 4,312,023,556, 14,014,076,557, 28,028,153,114, 56,056,306,228, 182,182,995,241, 364,365,990,482, 728,731,980,96427 in total
Arithmetic
Previous number728,731,980,963
Next number728,731,980,965
Double1,457,463,961,928
Half364,365,990,482
Square531,050,300,079,715,658,369,296
Cube386,993,337,168,617,838,837,306,539,954,081,344
Square root853,658exact
Cube root8,998.896905808≈
Negation-728,731,980,964
Reciprocal1.37224662 × 10^-12≈
Representations
Decimal728,731,980,964
Binary101010011010101111001111100101001010010040 bits
Octal12465363712244
HexadecimalA9ABCF94A4
Base 369ARW7F6S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and twenty-eight billion, seven hundred and thirty-one million, nine hundred and eighty thousand, nine hundred and sixty-four
Ordinalseven hundred and twenty-eight billion, seven hundred and thirty-one million, nine hundred and eighty thousand, nine hundred and sixty-fourth
Scientific notation7.28731981 × 10^11
Engineering notation728.731981 × 10^9
In other bases
Ternary2120122222120210021000001base 3; the most digit-efficient integer base after e: 25 digits
Quinary43414420341342324base 5; one hand: 17 digits
Septenary103435441430611base 7: 15 digits
Nonary2518876707001base 9; each digit is two ternary digits: 13 digits
Duodecimalb9296a48484base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal18968ehc84base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal15:37:9:19:10:16:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10TT1T00000TT1T101T1000001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111011111100110100001001010111100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001010100110101011110011111001010010100100
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 even
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes5a9 ab cf 94 a4
Gray code1111110101111110001010000101111011110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001010100110101011110011111001010010100100
One's complement1111111111111111111111110101011001010100001100000110101101011011at 64 bits, every bit flipped
Bits reversed0010010100101001111100111101010110010101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101001101010111100111110010100101001000at 64 bits, wrapping
Shifted left by 110101001101010111100111110010100101001000= 1,457,463,961,928, no wrap
Shifted right by 1101010011010101111001111100101001010010= 364,365,990,482, discarding the low bit
These bits as a double3.60041437 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
728,731,980,964 to the power 2531,050,300,079,715,658,369,296
728,731,980,964 to the power 3386,993,337,168,617,838,837,306,539,954,081,344
728,731,980,964 to the power 4282014421214756048589778889366… (48 digits)
728,731,980,964 to the power 5205512927832245082556830608651… (60 digits)
First ten multiples728,731,980,964, 1,457,463,961,928, 2,186,195,942,892, 2,914,927,923,856, 3,643,659,904,820, 4,372,391,885,784, 5,101,123,866,748, 5,829,855,847,712, 6,558,587,828,676, 7,287,319,809,640
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 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1324the total stopping time
Highest value reached2,075,178,180,1842× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps728,731,980,964 → 364,365,990,482 → 182,182,995,241 → 546,548,985,724 → 273,274,492,862 → 136,637,246,431 → 409,911,739,294 → 204,955,869,647 → 614,867,608,942 → 307,433,804,471 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage72,873,198,096,400%
728,731,980,964% as a decimal7,287,319,809.64
728,731,980,964% of 100728,731,980,964
728,731,980,964% of 1,0007,287,319,809,640
As a fraction of 100728,731,980,964/100
Read another way
As seconds23,092 years, 44 days and 22 hours
As bytes678.685 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 728,731,980,964
Nearby primes
Also reads as
728731980964 (identifier)
- 12 characters
- Checksum valid
728731980964 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). 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 validGS1 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