Recognised as Number

2,005,565,792,411

Positive
Odd
Prime
13 digits

2,005,565,792,411 is an odd 13-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value2,005,565,792,411

Digit count13

Digit sum47

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2,005,565,792,411

Distinct prime factors12,005,565,792,411

Number of divisors2

Sum of divisors σ(n)2,005,565,792,412

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,005,565,792,410integers below n that share no factor with it

Carmichael function λ(n)2,005,565,792,410the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2,005,565,792,4112 in total

Arithmetic

Previous number2,005,565,792,410

Next number2,005,565,792,412

Double4,011,131,584,822

Half1,002,782,896,205.5

Square4,022,294,147,689,162,345,192,921

Cube8,066,975,549,620,342,743,353,663,722,032,722,531

Square root1,416,180.00000388≈irrational, shown to 9 decimal places

Cube root12,610.88710574≈

Negation-2,005,565,792,411

Reciprocal4.98612413 × 10^-13≈

Representations

Decimal2,005,565,792,411

Binary1110100101111010100001001011000001001101141 bits

Octal35136502260233

Hexadecimal1D2F509609B

Base 36PLCE39GB

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

In wordstwo trillion, five billion, five hundred and sixty-five million, seven hundred and ninety-two thousand, four hundred and eleven

Ordinaltwo trillion, five billion, five hundred and sixty-five million, seven hundred and ninety-two thousand, four hundred and eleventh

Scientific notation2.00556579 × 10^12

Engineering notation2.005566 × 10^12

In other bases

Ternary21002201201022212101210202base 3; the most digit-efficient integer base after e: 26 digits

Quinary230324344320324121base 5; one hand: 18 digits

Septenary264616534650056base 7: 15 digits

Nonary7081638771722base 9; each digit is two ternary digits: 13 digits

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

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

Sexagesimal42:59:10:26:49:0:11base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000011101001011110101000010010110000010011011

Bit length41 bitsto write the magnitude

Set bits20the population count, or Hamming weight

Zero bits21within that length

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

Highest set bitbit 40worth 1,099,511,627,776

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes601 d2 f5 09 60 9b

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

At each machine width

64-bit0000000000000000000000011101001011110101000010010110000010011011

One's complement1111111111111111111111100010110100001010111101101001111101100100at 64 bits, every bit flipped

Bits reversed1101100100000110100100001010111101001011100000000000000000000000at 64 bits

Rotated left by 10000000000000000000000111010010111101010000100101100000100110110at 64 bits, wrapping

Shifted left by 1111010010111101010000100101100000100110110= 4,011,131,584,822, no wrap

Shifted right by 11110100101111010100001001011000001001101= 1,002,782,896,205, discarding the low bit

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

Nearest landmarks

Next prime2,005,565,792,437+26

Previous prime2,005,565,792,387−24

Distance to nearest prime0, it is prime

Nearest square below2,005,565,792,400

Nearest square above2,005,568,624,761

Powers & multiples

2,005,565,792,411 to the power 24,022,294,147,689,162,345,192,921

2,005,565,792,411 to the power 38,066,975,549,620,342,743,353,663,722,032,722,531

2,005,565,792,411 to the power 4161788502105344849442795041862… (50 digits)

2,005,565,792,411 to the power 5324477485427894684771156729948… (62 digits)

First ten multiples2,005,565,792,411, 4,011,131,584,822, 6,016,697,377,233, 8,022,263,169,644, 10,027,828,962,055, 12,033,394,754,466, 14,038,960,546,877, 16,044,526,339,288, 18,050,092,131,699, 20,055,657,924,110

Powers of twoBetween 2^40 (1,099,511,627,776) and 2^41 (2,199,023,255,552)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1403the total stopping time

Highest value reached156,305,183,176,09677× the starting value

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

First steps2,005,565,792,411 → 6,016,697,377,234 → 3,008,348,688,617 → 9,025,046,065,852 → 4,512,523,032,926 → 2,256,261,516,463 → 6,768,784,549,390 → 3,384,392,274,695 → 10,153,176,824,086 → 5,076,588,412,043 → …

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

As a percentage & fraction

As a percentage200,556,579,241,100%

2,005,565,792,411% as a decimal20,055,657,924.11

2,005,565,792,411% of 1002,005,565,792,411

2,005,565,792,411% of 1,00020,055,657,924,110

As a fraction of 1002,005,565,792,411/100

Read another way

As seconds63,552 years, 199 days and 1 hour

As bytes1.824 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,005,565,792,411

Nearby primes

2005565792411 (identifier)

13 characters
Checksum fails

2005565792411 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