Recognised as Number

17,334,566,085,113,202,025

Positive
Odd
Composite
Perfect square
20 digits

17,334,566,085,113,202,025 is an odd 20-digit integer and a composite number. It has 27 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value17,334,566,085,113,202,025

Digit count20

Digit sum64

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 4,163,480,045²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 271^2 × 3,072,679^2

Distinct prime factors35, 271, 3,072,679

Number of divisors27

Sum of divisors σ(n)21,574,478,482,721,386,263

Aliquot sum4,239,912,397,608,184,238sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)13,816,476,220,727,350,800integers below n that share no factor with it

Carmichael function λ(n)230,274,603,678,789,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,816,476,220,727,350,800

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 271, 1,355, 6,775, 73,441, 367,205, 1,836,025, 3,072,679, 15,363,395, 76,816,975, 832,696,009, 4,163,480,045, 20,817,400,225, 225,660,618,439, 1,128,303,092,195, 5,641,515,460,975, 9,441,356,237,041, 47,206,781,185,205, 236,033,905,926,025, 2,558,607,540,238,111, 12,793,037,701,190,555, 63,965,188,505,952,775, 693,382,643,404,528,081, 3,466,913,217,022,640,405, 17,334,566,085,113,202,02527 in total

Arithmetic

Previous number17,334,566,085,113,202,024

Next number17,334,566,085,113,202,026

Double34,669,132,170,226,404,050

Square300,487,181,359,156,843,191,649,458,948,464,100,625

Cube5,208,814,902,999,700,175,602,028,673,238,547,743,377,272,809,955,553,765,625

Square root4,163,480,045exact

Cube root2,588,040≈

Negation-17,334,566,085,113,202,025

Representations

Decimal17,334,566,085,113,202,025

Binary111100001001000011000000000000110000111010110100110001010110100164 bits

Octal1702206000141655142551

HexadecimalF090C0030EB4C569

Base 363NP72U3N78CQ1

In wordsseventeen quintillion, three hundred and thirty-four quadrillion, five hundred and sixty-six trillion, eighty-five billion, one hundred and thirteen million, two hundred and two thousand and twenty-five

Ordinalseventeen quintillion, three hundred and thirty-four quadrillion, five hundred and sixty-six trillion, eighty-five billion, one hundred and thirteen million, two hundred and two thousand and twenty-fifth

Engineering notation17.334566 × 10^18

In other bases

Ternary11021111020212120221111011212202010121201base 3; the most digit-efficient integer base after e: 41 digits

Quinary2130403102221214302434431100base 5; one hand: 28 digits

Septenary43015030523506315320352base 7: 23 digits

Nonary137436776844155663551base 9; each digit is two ternary digits: 21 digits

Duodecimal799136b3b7b4999661base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 18 digits

Vigesimalabc18e7djhha515base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits

Sexagesimal28:40:5:31:50:56:46:52:58:20:25base 60; Babylonian, and still how an hour and a circle are divided: 11 digits

Balanced ternary111T11111T10T0TT10T11111TT0T0T1T011T0TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011000110010001110000000000011100010011111101011101101010111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111000010010000110000000000001100001110101101001100010101101001

Bit length64 bitsto write the magnitude

Set bits25the population count, or Hamming weight

Zero bits39within that length

Bit parityodd25 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 63worth 9,223,372,036,854,775,808

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes8f0 90 c0 03 0e b4 c5 69

Gray code1000100011011000101000000000001010001001111011101010011111011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111000010010000110000000000001100001110101101001100010101101001

One's complement0000111101101111001111111111110011110001010010110011101010010110at 64 bits, every bit flipped

Bits reversed1001011010100011001011010111000011000000000000110000100100001111at 64 bits

Rotated left by 11110000100100001100000000000011000011101011010011000101011010011at 64 bits, wrapping

Shifted left by 111110000100100001100000000000011000011101011010011000101011010010= 34,669,132,170,226,404,050, no wrap

Shifted right by 1111100001001000011000000000000110000111010110100110001010110100= 8,667,283,042,556,601,012, discarding the low bit

These bits as a double-1.66430403 × 10^234≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)

Nearest landmarks

Next prime17,334,566,085,113,202,083+58

Previous prime17,334,566,085,113,202,011−14

Distance to nearest prime14

Nearest square below17,334,566,085,113,202,025

Nearest square above17,334,566,093,440,162,116

Powers & multiples

17,334,566,085,113,202,025 to the power 2300,487,181,359,156,843,191,649,458,948,464,100,625

17,334,566,085,113,202,025 to the power 3520881490299970017560202867323… (58 digits)

17,334,566,085,113,202,025 to the power 4902925461611708158240292153305… (77 digits)

17,334,566,085,113,202,025 to the power 5156518210842394986694284867684… (97 digits)

First ten multiples17,334,566,085,113,202,025, 34,669,132,170,226,404,050, 52,003,698,255,339,606,075, 69,338,264,340,452,808,100, 86,672,830,425,566,010,125, 104,007,396,510,679,212,150, 121,341,962,595,792,414,175, 138,676,528,680,905,616,200, 156,011,094,766,018,818,225, 173,345,660,851,132,020,250

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 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1351the total stopping time

Highest value reached131,634,361,208,828,377,8887× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps17,334,566,085,113,202,025 → 52,003,698,255,339,606,076 → 26,001,849,127,669,803,038 → 13,000,924,563,834,901,519 → 39,002,773,691,504,704,558 → 19,501,386,845,752,352,279 → 58,504,160,537,257,056,838 → 29,252,080,268,628,528,419 → 87,756,240,805,885,585,258 → 43,878,120,402,942,792,629 → …

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.