Recognised as Number

265,487,715,025

Positive
Odd
Composite
Perfect square
12 digits

265,487,715,025 is an odd 12-digit integer and a composite number. It has 27 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value265,487,715,025

Digit count12

Digit sum52

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, 515,255²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 13^2 × 7,927^2

Distinct prime factors35, 13, 7,927

Number of divisors27

Sum of divisors σ(n)356,521,142,961

Aliquot sum91,033,427,936sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)196,027,734,240integers below n that share no factor with it

Carmichael function λ(n)8,167,822,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 196,027,734,240

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 13, 25, 65, 169, 325, 845, 4,225, 7,927, 39,635, 103,051, 198,175, 515,255, 1,339,663, 2,576,275, 6,698,315, 33,491,575, 62,837,329, 314,186,645, 816,885,277, 1,570,933,225, 4,084,426,385, 10,619,508,601, 20,422,131,925, 53,097,543,005, 265,487,715,02527 in total

Arithmetic

Previous number265,487,715,024

Next number265,487,715,026

Double530,975,430,050

Half132,743,857,512.5

Square70,483,726,829,195,610,750,625

Cube18,712,563,582,329,431,156,942,756,340,640,625

Square root515,255exact

Cube root6,427.096340063≈

Negation-265,487,715,025

Reciprocal3.76665263 × 10^-12≈

Representations

Decimal265,487,715,025

Binary1111011101000001001101000010101101000138 bits

Octal3672023205321

Hexadecimal3DD04D0AD1

Base 363DYOJ3YP

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

In wordstwo hundred and sixty-five billion, four hundred and eighty-seven million, seven hundred and fifteen thousand and twenty-five

Ordinaltwo hundred and sixty-five billion, four hundred and eighty-seven million, seven hundred and fifteen thousand and twenty-fifth

Scientific notation2.65487715 × 10^11

Engineering notation265.487715 × 10^9

In other bases

Ternary221101021021222022001021base 3; the most digit-efficient integer base after e: 24 digits

Quinary13322204323340100base 5; one hand: 17 digits

Septenary25116014225611base 7: 14 digits

Nonary841237868037base 9; each digit is two ternary digits: 12 digits

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

Vigesimala784i47b5base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits

Sexagesimal5:41:25:9:47:30:25base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000000011110111010000010011010000101011010001

Bit length38 bitsto write the magnitude

Set bits18the population count, or Hamming weight

Zero bits20within that length

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

Highest set bitbit 37worth 137,438,953,472

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes53d d0 4d 0a d1

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

At each machine width

64-bit0000000000000000000000000011110111010000010011010000101011010001

One's complement1111111111111111111111111100001000101111101100101111010100101110at 64 bits, every bit flipped

Bits reversed1000101101010000101100100000101110111100000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000111101110100000100110100001010110100010at 64 bits, wrapping

Shifted left by 1111101110100000100110100001010110100010= 530,975,430,050, no wrap

Shifted right by 11111011101000001001101000010101101000= 132,743,857,512, discarding the low bit

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

Nearest landmarks

Next prime265,487,715,037+12

Previous prime265,487,715,011−14

Distance to nearest prime12

Nearest square below265,487,715,025

Nearest square above265,488,745,536

Powers & multiples

265,487,715,025 to the power 270,483,726,829,195,610,750,625

265,487,715,025 to the power 318,712,563,582,329,431,156,942,756,340,640,625

265,487,715,025 to the power 4496795574773266914466477454560… (46 digits)

265,487,715,025 to the power 5131893121981086165576137216371… (58 digits)

First ten multiples265,487,715,025, 530,975,430,050, 796,463,145,075, 1,061,950,860,100, 1,327,438,575,125, 1,592,926,290,150, 1,858,414,005,175, 2,123,901,720,200, 2,389,389,435,225, 2,654,877,150,250

Powers of twoBetween 2^37 (137,438,953,472) and 2^38 (274,877,906,944)

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 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1320the total stopping time

Highest value reached796,463,145,0763× the starting value

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

First steps265,487,715,025 → 796,463,145,076 → 398,231,572,538 → 199,115,786,269 → 597,347,358,808 → 298,673,679,404 → 149,336,839,702 → 74,668,419,851 → 224,005,259,554 → 112,002,629,777 → …

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

As a percentage & fraction

As a percentage26,548,771,502,500%

265,487,715,025% as a decimal2,654,877,150.25

265,487,715,025% of 100265,487,715,025

265,487,715,025% of 1,0002,654,877,150,250

As a fraction of 100265,487,715,025/100

Read another way

As seconds8,412 years, 291 days and 11 hours

As bytes247.255 GiB

Keep nerding

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

Neighbouring numbers

Derived from 265,487,715,025

Nearby primes

265487715025 (identifier)

12 characters
Checksum valid

265487715025 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

Checksum tests

Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled

GTIN-12 (UPC-A)Check digit validGS1 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