Recognised as Number
734,824,413,961
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
734,824,413,961 is an odd 12-digit integer and a composite number. It has 9 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value734,824,413,961
Digit count12
Digit sum52
Digit product3,483,648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 857,219²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11^2 × 77,929^2
Distinct prime factors211, 77,929
Number of divisors9
Sum of divisors σ(n)807,709,927,143
Aliquot sum72,885,513,182sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)668,013,622,320integers below n that share no factor with it
Carmichael function λ(n)334,006,811,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 668,013,622,320
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 11, 121, 77,929, 857,219, 9,429,409, 6,072,929,041, 66,802,219,451, 734,824,413,9619 in total
Arithmetic
Previous number734,824,413,960
Next number734,824,413,962
Double1,469,648,827,922
Square539,966,919,353,127,091,709,521
Cube396,780,875,071,988,164,378,201,070,469,022,681
Square root857,219exact
Cube root9,023.905229957≈
Negation-734,824,413,961
Reciprocal1.36086932 × 10^-12≈
Representations
Decimal734,824,413,961
Binary101010110001011011110010101110110000100140 bits
Octal12542674535411
HexadecimalAB16F2BB09
Base 369DKNHEKP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and thirty-four billion, eight hundred and twenty-four million, four hundred and thirteen thousand, nine hundred and sixty-one
Ordinalseven hundred and thirty-four billion, eight hundred and twenty-four million, four hundred and thirteen thousand, nine hundred and sixty-first
Scientific notation7.34824414 × 10^11
Engineering notation734.824414 × 10^9
In other bases
Ternary2121020201011202220220121base 3; the most digit-efficient integer base after e: 25 digits
Quinary44014410022221321base 5; one hand: 17 digits
Septenary104042430314131base 7: 15 digits
Nonary2536634686817base 9; each digit is two ternary digits: 13 digits
Duodecimalba4b7261b21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal18e1ccbei1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal15:44:59:24:52:46:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10TT11T1T011TTT100T10T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111101101011001101111100111100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001010101100010110111100101011101100001001
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
Bytes5ab 16 f2 bb 09
Gray code1111111010011101100010111110011010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001010101100010110111100101011101100001001
One's complement1111111111111111111111110101010011101001000011010100010011110110at 64 bits, every bit flipped
Bits reversed1001000011011101010011110110100011010101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101011000101101111001010111011000010010at 64 bits, wrapping
Shifted left by 110101011000101101111001010111011000010010= 1,469,648,827,922, no wrap
Shifted right by 1101010110001011011110010101110110000100= 367,412,206,980, discarding the low bit
These bits as a double3.63051499 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
734,824,413,961 to the power 2539,966,919,353,127,091,709,521
734,824,413,961 to the power 3396,780,875,071,988,164,378,201,070,469,022,681
734,824,413,961 to the power 4291564273995706456576339737570… (48 digits)
734,824,413,961 to the power 5214248546770859428783892742118… (60 digits)
First ten multiples734,824,413,961, 1,469,648,827,922, 2,204,473,241,883, 2,939,297,655,844, 3,674,122,069,805, 4,408,946,483,766, 5,143,770,897,727, 5,878,595,311,688, 6,613,419,725,649, 7,348,244,139,610
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 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1200the total stopping time
Highest value reached3,720,048,595,6845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps734,824,413,961 → 2,204,473,241,884 → 1,102,236,620,942 → 551,118,310,471 → 1,653,354,931,414 → 826,677,465,707 → 2,480,032,397,122 → 1,240,016,198,561 → 3,720,048,595,684 → 1,860,024,297,842 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage73,482,441,396,100%
734,824,413,961% as a decimal7,348,244,139.61
734,824,413,961% of 100734,824,413,961
734,824,413,961% of 1,0007,348,244,139,610
As a fraction of 100734,824,413,961/100
Read another way
As seconds23,285 years, 65 days and 22 hours
As bytes684.359 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 734,824,413,961
Nearby primes
Also reads as
734824413961 (identifier)
- 12 characters
- Checksum valid
734824413961 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