Recognised as Number
997,201,960,000
- Positive
- Even
- Composite
- Perfect square
- 12 digits
997,201,960,000 is an even 12-digit integer and a composite number. It has 105 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value997,201,960,000
Digit count12
Digit sum43
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 998,600²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 5^4 × 4,993^2
Distinct prime factors32, 5, 4,993
Number of divisors105
Sum of divisors σ(n)2,473,232,110,041
Aliquot sum1,476,030,150,041sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)398,800,896,000integers below n that share no factor with it
Carmichael function λ(n)3,115,632,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 398,800,896,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 160, 200, 250, 320, 400, 500, 625, 800, 1,000, 1,250, 1,600, 2,000, 2,500, 4,000, 4,993, 5,000, 8,000, 9,986, 10,000, 19,972, 20,000, 24,965, 39,944, 40,000, 49,930, 79,888, 99,860, 124,825, 159,776, 199,720, 249,650, 319,552, 399,440, 499,300, 624,125, 798,880, 998,600, 1,248,250, 1,597,760, 1,997,200, 2,496,500, 3,120,625, 3,994,400, 4,993,000, 6,241,250, 7,988,800, 9,986,000, 12,482,500, 19,972,000, 24,930,049, 24,965,000, 39,944,000, 49,860,098, 49,930,000, 99,720,196, 99,860,000, 124,650,245, 199,440,392, 199,720,000, 249,300,490, 398,880,784, 498,600,980, 623,251,225, 797,761,568, 997,201,960, 1,246,502,450, 1,595,523,136, 1,994,403,920, 2,493,004,900, 3,116,256,125, 3,988,807,840, 4,986,009,800, 6,232,512,250, 7,977,615,680, 9,972,019,600, 12,465,024,500, 15,581,280,625, 19,944,039,200, 24,930,049,000, 31,162,561,250, 39,888,078,400, 49,860,098,000, 62,325,122,500, 99,720,196,000, 124,650,245,000, 199,440,392,000, 249,300,490,000, 498,600,980,000, 997,201,960,000105 in total
Arithmetic
Previous number997,201,959,999
Next number997,201,960,001
Double1,994,403,920,000
Half498,600,980,000
Square994,411,749,027,841,600,000,000
Cube991,629,345,177,591,738,089,536,000,000,000,000
Square root998,600exact
Cube root9,990.664487533≈
Negation-997,201,960,000
Reciprocal1.00280589 × 10^-12≈
Representations
Decimal997,201,960,000
Binary111010000010110111011110010111000100000040 bits
Octal16405567456100
HexadecimalE82DDE5C40
Base 36CQ3WASSG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine hundred and ninety-seven billion, two hundred and one million, nine hundred and sixty thousand
Ordinalnine hundred and ninety-seven billion, two hundred and one million, nine hundred and sixty thousandth
Scientific notation9.9720196 × 10^11
Engineering notation997.20196 × 10^9
In other bases
Ternary10112022221201102021011221base 3; the most digit-efficient integer base after e: 26 digits
Quinary112314232200210000base 5; one hand: 18 digits
Septenary132021410543011base 7: 15 digits
Nonary3468851367157base 9; each digit is two ternary digits: 13 digits
Duodecimal141320b03714base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1ij15c5000base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal21:22:24:35:44:26:40base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11TTT10000TT0111T1T11TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100001110010001000111010110001000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001110100000101101110111100101110001000000
Bit length40 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits21within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being even
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes5e8 2d de 5c 40
Gray code1001110000111011001100010111001001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001110100000101101110111100101110001000000
One's complement1111111111111111111111110001011111010010001000011010001110111111at 64 bits, every bit flipped
Bits reversed0000001000111010011110111011010000010111000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000011101000001011011101111001011100010000000at 64 bits, wrapping
Shifted left by 111101000001011011101111001011100010000000= 1,994,403,920,000, no wrap
Shifted right by 1111010000010110111011110010111000100000= 498,600,980,000, discarding the low bit
These bits as a double4.9268323 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
997,201,960,000 to the power 2994,411,749,027,841,600,000,000
997,201,960,000 to the power 3991,629,345,177,591,738,089,536,000,000,000,000
997,201,960,000 to the power 4988854726604611029302691954690… (48 digits)
997,201,960,000 to the power 5986087871525382263458261850493… (60 digits)
First ten multiples997,201,960,000, 1,994,403,920,000, 2,991,605,880,000, 3,988,807,840,000, 4,986,009,800,000, 5,983,211,760,000, 6,980,413,720,000, 7,977,615,680,000, 8,974,817,640,000, 9,972,019,600,000
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1278the total stopping time
Highest value reached997,201,960,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps997,201,960,000 → 498,600,980,000 → 249,300,490,000 → 124,650,245,000 → 62,325,122,500 → 31,162,561,250 → 15,581,280,625 → 46,743,841,876 → 23,371,920,938 → 11,685,960,469 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage99,720,196,000,000%
997,201,960,000% as a decimal9,972,019,600
997,201,960,000% of 100997,201,960,000
997,201,960,000% of 1,0009,972,019,600,000
As a fraction of 100997,201,960,000/100
Read another way
As seconds31,599 years, 154 days and 14 hours
As bytes928.717 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,201,960,000
Nearby primes
Also reads as
997201960000 (identifier)
- 12 characters
- Checksum fails
997201960000 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