Recognised as Number
17,334,566,092,799,999,998
- Positive
- Even
- Composite
- 20 digits
17,334,566,092,799,999,998 is an even 20-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value17,334,566,092,799,999,998
Digit count20
Digit sum124
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
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 109 × 5,569 × 14,278,390,774,619
Distinct prime factors42, 109, 5,569, 14,278,390,774,619
Number of divisors16
Sum of divisors σ(n)26,245,110,082,829,022,000
Aliquot sum8,910,543,990,029,022,002sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,586,224,621,971,886,592integers below n that share no factor with it
Carmichael function λ(n)357,759,359,248,828,608the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,586,224,621,971,886,592
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 109, 218, 5,569, 11,138, 607,021, 1,214,042, 14,278,390,774,619, 28,556,781,549,238, 1,556,344,594,433,471, 3,112,689,188,866,942, 79,516,358,223,853,211, 159,032,716,447,706,422, 8,667,283,046,399,999,999, 17,334,566,092,799,999,99816 in total
Arithmetic
Previous number17,334,566,092,799,999,997
Next number17,334,566,092,799,999,999
Square300,487,181,625,651,458,142,501,735,628,800,000,004
Cube5,208,814,909,929,052,948,426,914,693,744,843,250,936,974,793,113,599,999,992
Square root4,163,480,045≈irrational, shown to 9 decimal places
Cube root2,588,040≈
Negation-17,334,566,092,799,999,998
Representations
Decimal17,334,566,092,799,999,998
Binary111100001001000011000000000001001101100011011111111111111111111064 bits
Octal1702206000233067777776
HexadecimalF090C004D8DFFFFE
Base 363NP72U76BR3ZY
In wordsseventeen quintillion, three hundred and thirty-four quadrillion, five hundred and sixty-six trillion, ninety-two billion, seven hundred and ninety-nine million, nine hundred and ninety-nine thousand, nine hundred and ninety-eight
Ordinalseventeen quintillion, three hundred and thirty-four quadrillion, five hundred and sixty-six trillion, ninety-two billion, seven hundred and ninety-nine million, nine hundred and ninety-nine thousand, nine hundred and ninety-eighth
Engineering notation17.334566 × 10^18
In other bases
Ternary11021111020212120222020000120210221002221base 3; the most digit-efficient integer base after e: 41 digits
Quinary2130403102221331023244444443base 5; one hand: 28 digits
Septenary43015030524200644114153base 7: 23 digits
Nonary137436776866016727087base 9; each digit is two ternary digits: 21 digits
Duodecimal799136b4119b13bbbabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 18 digits
Vigesimalabc18e7jjjjjjjibase 20; hands and feet, and the Mayan and Yoruba systems: 15 digits
Sexagesimal28:40:5:31:51:6:39:59:59:59:58base 60; Babylonian, and still how an hour and a circle are divided: 11 digits
Balanced ternary111T11111T10T0TT100T1T0001TT1T110T10100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000110010001110000000000010100101001001000000000000000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111000010010000110000000000010011011000110111111111111111111110
Bit length64 bitsto write the magnitude
Set bits35the population count, or Hamming weight
Zero bits29within that length
Bit parityodd35 set bits, so odd; not the same as the number itself being even
Highest set bitbit 63worth 9,223,372,036,854,775,808
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes8f0 90 c0 04 d8 df ff fe
Gray code1000100011011000101000000000011010110100101100000000000000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111000010010000110000000000010011011000110111111111111111111110
One's complement0000111101101111001111111111101100100111001000000000000000000001at 64 bits, every bit flipped
Bits reversed0111111111111111111110110001101100100000000000110000100100001111at 64 bits
Rotated left by 11110000100100001100000000000100110110001101111111111111111111101at 64 bits, wrapping
Shifted left by 111110000100100001100000000000100110110001101111111111111111111100= 34,669,132,185,599,999,996, no wrap
Shifted right by 1111100001001000011000000000001001101100011011111111111111111111= 8,667,283,046,399,999,999, discarding the low bit
These bits as a double-1.66430674 × 10^234≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)
Nearest landmarks
Distance to nearest prime31
Nearest square below17,334,566,085,113,202,025
Nearest square above17,334,566,093,440,162,116
Powers & multiples
17,334,566,092,799,999,998 to the power 2300,487,181,625,651,458,142,501,735,628,800,000,004
17,334,566,092,799,999,998 to the power 3520881490992905294842691469374… (58 digits)
17,334,566,092,799,999,998 to the power 4902925463213272472829994327292… (77 digits)
17,334,566,092,799,999,998 to the power 5156518211189425267406405779982… (97 digits)
First ten multiples17,334,566,092,799,999,998, 34,669,132,185,599,999,996, 52,003,698,278,399,999,994, 69,338,264,371,199,999,992, 86,672,830,463,999,999,990, 104,007,396,556,799,999,988, 121,341,962,649,599,999,986, 138,676,528,742,399,999,984, 156,011,094,835,199,999,982, 173,345,660,927,999,999,980
Powers of twoBetween 2^63 (9,223,372,036,854,775,808) and 2^64 (18,446,744,073,709,551,616)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12No, remainder 10
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 1850the total stopping time
Highest value reached109,429,511,428,373,230,206,3046,312× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps17,334,566,092,799,999,998 → 8,667,283,046,399,999,999 → 26,001,849,139,199,999,998 → 13,000,924,569,599,999,999 → 39,002,773,708,799,999,998 → 19,501,386,854,399,999,999 → 58,504,160,563,199,999,998 → 29,252,080,281,599,999,999 → 87,756,240,844,799,999,998 → 43,878,120,422,399,999,999 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 17,334,566,092,799,999,998
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page