Recognised as Number
997,235,912,689
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
997,235,912,689 is an odd 12-digit integer and a composite number. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value997,235,912,689
Digit count12
Digit sum70
Digit product132,269,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 998,617²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation998,617^2
Distinct prime factors1998,617
Number of divisors3
Sum of divisors σ(n)997,236,911,307
Aliquot sum998,618sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)997,234,914,072integers below n that share no factor with it
Carmichael function λ(n)997,234,914,072the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 998,617, 997,235,912,6893 in total
Arithmetic
Previous number997,235,912,688
Next number997,235,912,690
Double1,994,471,825,378
Square994,479,465,556,662,831,210,721
Cube991,730,637,484,867,597,927,466,111,316,738,769
Square root998,617exact
Cube root9,990.777873483≈
Negation-997,235,912,689
Reciprocal1.00277175 × 10^-12≈
Representations
Decimal997,235,912,689
Binary111010000010111111100100011011111111000140 bits
Octal16405771067761
HexadecimalE82FE46FF1
Base 36CQ4GIIUP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine hundred and ninety-seven billion, two hundred and thirty-five million, nine hundred and twelve thousand, six hundred and eighty-nine
Ordinalnine hundred and ninety-seven billion, two hundred and thirty-five million, nine hundred and twelve thousand, six hundred and eighty-ninth
Scientific notation9.97235913 × 10^11
Engineering notation997.235913 × 10^9
In other bases
Ternary10112100001002022020111221base 3; the most digit-efficient integer base after e: 26 digits
Quinary112314314343201224base 5; one hand: 18 digits
Septenary132022302253312base 7: 15 digits
Nonary3470032266457base 9; each digit is two ternary digits: 13 digits
Duodecimal141330358181base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1ij1g491e9base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal21:22:27:12:55:44:49base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11TTT10000101T10T1T1TTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100001110000001001011011000000110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001110100000101111111001000110111111110001
Bit length40 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits16within that length
Bit parityeven24 set bits, so even; 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
Bytes5e8 2f e4 6f f1
Gray code1001110000111000000101100101100000001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001110100000101111111001000110111111110001
One's complement1111111111111111111111110001011111010000000110111001000000001110at 64 bits, every bit flipped
Bits reversed1000111111110110001001111111010000010111000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000011101000001011111110010001101111111100010at 64 bits, wrapping
Shifted left by 111101000001011111110010001101111111100010= 1,994,471,825,378, no wrap
Shifted right by 1111010000010111111100100011011111111000= 498,617,956,344, discarding the low bit
These bits as a double4.92700005 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
997,235,912,689 to the power 2994,479,465,556,662,831,210,721
997,235,912,689 to the power 3991,730,637,484,867,597,927,466,111,316,738,769
997,235,912,689 to the power 4988989407413865734445519752340… (48 digits)
997,235,912,689 to the power 5986255754342119658843481195571… (60 digits)
First ten multiples997,235,912,689, 1,994,471,825,378, 2,991,707,738,067, 3,988,943,650,756, 4,986,179,563,445, 5,983,415,476,134, 6,980,651,388,823, 7,977,887,301,512, 8,975,123,214,201, 9,972,359,126,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 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1296the total stopping time
Highest value reached2,991,707,738,0683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps997,235,912,689 → 2,991,707,738,068 → 1,495,853,869,034 → 747,926,934,517 → 2,243,780,803,552 → 1,121,890,401,776 → 560,945,200,888 → 280,472,600,444 → 140,236,300,222 → 70,118,150,111 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage99,723,591,268,900%
997,235,912,689% as a decimal9,972,359,126.89
997,235,912,689% of 100997,235,912,689
997,235,912,689% of 1,0009,972,359,126,890
As a fraction of 100997,235,912,689/100
Read another way
As seconds31,600 years, 182 days and 7 hours
As bytes928.748 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 997,235,912,689
Nearby primes
Also reads as
997235912689 (identifier)
- 12 characters
- Checksum fails
997235912689 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