Recognised as Number

2,573,525,016,841

Positive
Odd
Composite
Perfect square
13 digits

2,573,525,016,841 is an odd 13-digit integer and a composite number. It has 9 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,573,525,016,841

Digit count13

Digit sum49

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,604,221²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation613^2 × 2,617^2

Distinct prime factors2613, 2,617

Number of divisors9

Sum of divisors σ(n)2,578,715,482,581

Aliquot sum5,190,465,740sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,568,344,987,232integers below n that share no factor with it

Carmichael function λ(n)214,028,748,936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,568,344,987,232

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

SquarefreeNohas a repeated prime factor

All divisors1, 613, 2,617, 375,769, 1,604,221, 6,848,689, 983,387,473, 4,198,246,357, 2,573,525,016,8419 in total

Arithmetic

Previous number2,573,525,016,840

Next number2,573,525,016,842

Double5,147,050,033,682

Half1,286,762,508,420.5

Square6,623,031,012,306,469,333,619,281

Cube17,044,535,997,484,471,770,055,810,183,007,311,321

Square root1,604,221exact

Cube root13,703.856368767≈

Negation-2,573,525,016,841

Reciprocal3.88572092 × 10^-13≈

Representations

Decimal2,573,525,016,841

Binary10010101110011001000001011011000010000100142 bits

Octal45346202660411

Hexadecimal257320B6109

Base 36WU9ECJRD

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

In wordstwo trillion, five hundred and seventy-three billion, five hundred and twenty-five million, sixteen thousand, eight hundred and forty-one

Ordinaltwo trillion, five hundred and seventy-three billion, five hundred and twenty-five million, sixteen thousand, eight hundred and forty-first

Scientific notation2.57352502 × 10^12

Engineering notation2.573525 × 10^12

In other bases

Ternary100010000201101100102010111base 3; the most digit-efficient integer base after e: 27 digits

Quinary314131034401014331base 5; one hand: 18 digits

Septenary353634230466202base 7: 15 digits

Nonary10100641312114base 9; each digit is two ternary digits: 14 digits

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

Vigesimal50ab6b7221base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits

Sexagesimal55:9:34:27:40:14:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000100101011100110010000010110110000100001001

Bit length42 bitsto write the magnitude

Set bits17the population count, or Hamming weight

Zero bits25within that length

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

Highest set bitbit 41worth 2,199,023,255,552

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes602 57 32 0b 61 09

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

At each machine width

64-bit0000000000000000000000100101011100110010000010110110000100001001

One's complement1111111111111111111111011010100011001101111101001001111011110110at 64 bits, every bit flipped

Bits reversed1001000010000110110100000100110011101010010000000000000000000000at 64 bits

Rotated left by 10000000000000000000001001010111001100100000101101100001000010010at 64 bits, wrapping

Shifted left by 11001010111001100100000101101100001000010010= 5,147,050,033,682, no wrap

Shifted right by 110010101110011001000001011011000010000100= 1,286,762,508,420, discarding the low bit

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

Nearest landmarks

Next prime2,573,525,016,859+18

Previous prime2,573,525,016,781−60

Distance to nearest prime18

Nearest square below2,573,525,016,841

Nearest square above2,573,528,225,284

Powers & multiples

2,573,525,016,841 to the power 26,623,031,012,306,469,333,619,281

2,573,525,016,841 to the power 317,044,535,997,484,471,770,055,810,183,007,311,321

2,573,525,016,841 to the power 4438645397899732559456688679807… (50 digits)

2,573,525,016,841 to the power 5112886490501713638110517076851… (63 digits)

First ten multiples2,573,525,016,841, 5,147,050,033,682, 7,720,575,050,523, 10,294,100,067,364, 12,867,625,084,205, 15,441,150,101,046, 18,014,675,117,887, 20,588,200,134,728, 23,161,725,151,569, 25,735,250,168,410

Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1243the total stopping time

Highest value reached13,028,470,397,7645× the starting value

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

First steps2,573,525,016,841 → 7,720,575,050,524 → 3,860,287,525,262 → 1,930,143,762,631 → 5,790,431,287,894 → 2,895,215,643,947 → 8,685,646,931,842 → 4,342,823,465,921 → 13,028,470,397,764 → 6,514,235,198,882 → …

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

As a percentage & fraction

As a percentage257,352,501,684,100%

2,573,525,016,841% as a decimal25,735,250,168.41

2,573,525,016,841% of 1002,573,525,016,841

2,573,525,016,841% of 1,00025,735,250,168,410

As a fraction of 1002,573,525,016,841/100

Read another way

As seconds81,550 years, 31 days and 16 hours

As bytes2.341 TiB

Keep nerding

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

Neighbouring numbers

Derived from 2,573,525,016,841

Nearby primes

2573525016841 (identifier)

13 characters
Checksum fails

2573525016841 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). No check digit validates. 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

ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3

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

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