Recognised as Number
979,898,050,404
- Positive
- Even
- Composite
- Perfect square
- 12 digits
979,898,050,404 is an even 12-digit integer and a composite number. It has 567 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value979,898,050,404
Digit count12
Digit sum63
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 989,898²
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3^2 × 7^6 × 13^2 × 37^2
Distinct prime factors52, 3, 7, 13, 37
Number of divisors567
Sum of divisors σ(n)3,216,037,335,147
Aliquot sum2,236,139,284,743sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)251,449,930,368integers below n that share no factor with it
Carmichael function λ(n)291,030,012the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 251,449,930,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors567 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number979,898,050,403
Next number979,898,050,405
Double1,959,796,100,808
Half489,949,025,202
Square960,200,189,185,560,124,563,216
Cube940,898,293,380,482,330,648,218,750,452,339,264
Square root989,898exact
Cube root9,932.539431882≈
Negation-979,898,050,404
Reciprocal1.02051433 × 10^-12≈
Representations
Decimal979,898,050,404
Binary111001000010011001111001101001110110010040 bits
Octal16204636323544
HexadecimalE42679A764
Base 36CI5PZYP0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine hundred and seventy-nine billion, eight hundred and ninety-eight million, fifty thousand, four hundred and four
Ordinalnine hundred and seventy-nine billion, eight hundred and ninety-eight million, fifty thousand, four hundred and fourth
Scientific notation9.7989805 × 10^11
Engineering notation979.89805 × 10^9
In other bases
Ternary10110200021210001120200100base 3; the most digit-efficient integer base after e: 26 digits
Quinary112023312400103104base 5; one hand: 18 digits
Septenary130536534000000base 7: 15 digits
Nonary3420253046610base 9; each digit is two ternary digits: 13 digits
Duodecimal139ab1a5b030base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1i5ai2g604base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal21:0:9:25:2:53:24base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10111T0010TT1001TTT1T00100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010001111011100011101111100010100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001110010000100110011110011010011101100100
Bit length40 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits20within that length
Bit parityeven20 set bits, so even; 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
Bytes5e4 26 79 a7 64
Gray code1001011000110101010001010111010011010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001110010000100110011110011010011101100100
One's complement1111111111111111111111110001101111011001100001100101100010011011at 64 bits, every bit flipped
Bits reversed0010011011100101100111100110010000100111000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000011100100001001100111100110100111011001000at 64 bits, wrapping
Shifted left by 111100100001001100111100110100111011001000= 1,959,796,100,808, no wrap
Shifted right by 1111001000010011001111001101001110110010= 489,949,025,202, discarding the low bit
These bits as a double4.84133963 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
979,898,050,404 to the power 2960,200,189,185,560,124,563,216
979,898,050,404 to the power 3940,898,293,380,482,330,648,218,750,452,339,264
979,898,050,404 to the power 4921984403311985454387359651123… (48 digits)
979,898,050,404 to the power 5903450719308309787320579790357… (60 digits)
First ten multiples979,898,050,404, 1,959,796,100,808, 2,939,694,151,212, 3,919,592,201,616, 4,899,490,252,020, 5,879,388,302,424, 6,859,286,352,828, 7,839,184,403,232, 8,819,082,453,636, 9,798,980,504,040
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9Yes
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12Yes
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1252the total stopping time
Highest value reached979,898,050,404
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps979,898,050,404 → 489,949,025,202 → 244,974,512,601 → 734,923,537,804 → 367,461,768,902 → 183,730,884,451 → 551,192,653,354 → 275,596,326,677 → 826,788,980,032 → 413,394,490,016 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage97,989,805,040,400%
979,898,050,404% as a decimal9,798,980,504.04
979,898,050,404% of 100979,898,050,404
979,898,050,404% of 1,0009,798,980,504,040
As a fraction of 100979,898,050,404/100
Read another way
As seconds31,051 years, 34 days and 20 hours
As bytes912.601 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 979,898,050,404
Nearby primes
Also reads as
979898050404 (identifier)
- 12 characters
- Checksum fails
979898050404 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