Recognised as Number

263,507,854,055,625

Positive
Odd
Composite
Perfect square
15 digits

263,507,854,055,625 is an odd 15-digit integer and a composite number. It has 135 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value263,507,854,055,625

Digit count15

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, 16,232,925²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5^4 × 41^2 × 5,279^2

Distinct prime factors43, 5, 41, 5,279

Number of divisors135

Sum of divisors σ(n)487,601,759,114,899

Aliquot sum224,093,905,059,274sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)137,083,805,040,000integers below n that share no factor with it

Carmichael function λ(n)1,713,547,563,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 137,083,805,040,000

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 25, 41, 45, 75, 123, 125, 205, 225, 369, 375, 615, 625, 1,025, 1,125, 1,681, 1,845, 1,875, 3,075, 5,043, 5,125, 5,279, 5,625, 8,405, 9,225, 15,129, 15,375, 15,837, 25,215, 25,625, 26,395, 42,025, 46,125, 47,511, 75,645, 76,875, 79,185, 126,075, 131,975, 210,125, 216,439, 230,625, 237,555, 378,225, 395,925, 630,375, 649,317, 659,875, 1,050,625, 1,082,195, 1,187,775, 1,891,125, 1,947,951, 1,979,625, 3,151,875, 3,246,585, 3,299,375, 5,410,975, 5,938,875, 8,873,999, 9,455,625, 9,739,755, 9,898,125, 16,232,925, 26,621,997, 27,054,875, 27,867,841, 29,694,375, 44,369,995, 48,698,775, 79,865,991, 81,164,625, 83,603,523, 133,109,985, 135,274,375, 139,339,205, 221,849,975, 243,493,875, 250,810,569, 399,329,955, 405,823,125, 418,017,615, 665,549,925, 696,696,025, 1,109,249,875, 1,142,581,481, 1,217,469,375, 1,254,052,845, 1,996,649,775, 2,090,088,075, 3,327,749,625, 3,427,744,443, 3,483,480,125, 5,546,249,375, 5,712,907,405, 6,270,264,225, 9,983,248,875, 10,283,233,329, 10,450,440,375, 16,638,748,125, 17,138,722,215, 17,417,400,625, 28,564,537,025, 31,351,321,125, 46,845,840,721, 49,916,244,375, 51,416,166,645, 52,252,201,875, 85,693,611,075, 140,537,522,163, 142,822,685,125, 156,756,605,625, 234,229,203,605, 257,080,833,225, 421,612,566,489, 428,468,055,375, 702,687,610,815, 714,113,425,625, 1,171,146,018,025, 1,285,404,166,125, 2,108,062,832,445, 2,142,340,276,875, 3,513,438,054,075, 5,855,730,090,125, 6,427,020,830,625, 10,540,314,162,225, 17,567,190,270,375, 29,278,650,450,625, 52,701,570,811,125, 87,835,951,351,875, 263,507,854,055,625135 in total

Arithmetic

Previous number263,507,854,055,624

Next number263,507,854,055,626

Double527,015,708,111,250

Half131,753,927,027,813

Square69,436,389,149,000,564,760,594,140,625

Cube18,297,033,898,024,424,211,265,342,175,876,017,822,265,625

Square root16,232,925exact

Cube root64,110.79879815≈

Negation-263,507,854,055,625

Reciprocal3.7949533 × 10^-15≈

Representations

Decimal263,507,854,055,625

Binary11101111101010001011010000001001010110001100100148 bits

Octal7372426402254311

HexadecimalEFA8B40958C9

Base 362LELU4QEO9

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo hundred and sixty-three trillion, five hundred and seven billion, eight hundred and fifty-four million, fifty-five thousand, six hundred and twenty-five

Ordinaltwo hundred and sixty-three trillion, five hundred and seven billion, eight hundred and fifty-four million, fifty-five thousand, six hundred and twenty-fifth

Scientific notation2.63507854 × 10^14

Engineering notation263.507854 × 10^12

In other bases

Ternary1021120000002211102021221002100base 3; the most digit-efficient integer base after e: 31 digits

Quinary234014303041114240000base 5; one hand: 21 digits

Septenary106334546162051244base 7: 18 digits

Nonary1246002742257070base 9; each digit is two ternary digits: 16 digits

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

Vigesimal15ed5a47gj15base 20; hands and feet, and the Mayan and Yoruba systems: 12 digits

Sexagesimal1:34:7:53:16:8:46:33:45base 60; Babylonian, and still how an hour and a circle are divided: 9 digits

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

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

Bit-level

0000000000000000111011111010100010110100000010010101100011001001

Bit length48 bitsto write the magnitude

Set bits23the population count, or Hamming weight

Zero bits25within that length

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

Highest set bitbit 47worth 140,737,488,355,328

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes6ef a8 b4 09 58 c9

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

At each machine width

64-bit0000000000000000111011111010100010110100000010010101100011001001

One's complement1111111111111111000100000101011101001011111101101010011100110110at 64 bits, every bit flipped

Bits reversed1001001100011010100100000010110100010101111101110000000000000000at 64 bits

Rotated left by 10000000000000001110111110101000101101000000100101011000110010010at 64 bits, wrapping

Shifted left by 11110111110101000101101000000100101011000110010010= 527,015,708,111,250, no wrap

Shifted right by 111101111101010001011010000001001010110001100100= 131,753,927,027,812, discarding the low bit

These bits as a double1.30190178 × 10^-309≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime263,507,854,055,629+4

Previous prime263,507,854,055,603−22

Distance to nearest prime4

Nearest square below263,507,854,055,625

Nearest square above263,507,886,521,476

Powers & multiples

263,507,854,055,625 to the power 269,436,389,149,000,564,760,594,140,625

263,507,854,055,625 to the power 3182970338980244242112653421758… (44 digits)

263,507,854,055,625 to the power 4482141213805144337407378153809… (58 digits)

263,507,854,055,625 to the power 5127047996601567863528381294845… (73 digits)

First ten multiples263,507,854,055,625, 527,015,708,111,250, 790,523,562,166,875, 1,054,031,416,222,500, 1,317,539,270,278,125, 1,581,047,124,333,750, 1,844,554,978,389,375, 2,108,062,832,445,000, 2,371,570,686,500,625, 2,635,078,540,556,250

Powers of twoBetween 2^47 (140,737,488,355,328) and 2^48 (281,474,976,710,656)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1286the total stopping time

Highest value reached1,334,008,511,156,6085× the starting value

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

First steps263,507,854,055,625 → 790,523,562,166,876 → 395,261,781,083,438 → 197,630,890,541,719 → 592,892,671,625,158 → 296,446,335,812,579 → 889,339,007,437,738 → 444,669,503,718,869 → 1,334,008,511,156,608 → 667,004,255,578,304 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2.63507854 × 10^16%

263,507,854,055,625% as a decimal2,635,078,540,556.25

263,507,854,055,625% of 100263,507,854,055,625

263,507,854,055,625% of 1,0002.63507854 × 10^15

As a fraction of 100263,507,854,055,625/100

Read another way

As seconds8,350,060 years, 6 days and 22 hours

As bytes239.659 TiB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.