Recognised as Number

10,779,215,311

Positive
Odd
Prime
11 digits

10,779,215,311 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value10,779,215,311

Digit count11

Digit sum37

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

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation10,779,215,311

Distinct prime factors110,779,215,311

Number of divisors2

Sum of divisors σ(n)10,779,215,312

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)10,779,215,310integers below n that share no factor with it

Carmichael function λ(n)10,779,215,310the 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, 10,779,215,3112 in total

Arithmetic

Previous number10,779,215,310

Next number10,779,215,312

Double21,558,430,622

Half5,389,607,655.5

Square116,191,482,720,896,826,721

Cube1,252,453,009,552,883,014,242,317,125,231

Square root103,822.999913314≈irrational, shown to 9 decimal places

Cube root2,208.99999877≈

Negation-10,779,215,311

Reciprocal9.27711314 × 10^-11≈

Representations

Decimal10,779,215,311

Binary101000001001111101110001011100111134 bits

Octal120237342717

Hexadecimal2827DC5CF

Base 364Y9NZRJ

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

In wordsten billion, seven hundred and seventy-nine million, two hundred and fifteen thousand, three hundred and eleven

Ordinalten billion, seven hundred and seventy-nine million, two hundred and fifteen thousand, three hundred and eleventh

Scientific notation1.07792153 × 10^10

Engineering notation10.779215 × 10^9

In other bases

Ternary1000211012222212120201base 3; the most digit-efficient integer base after e: 22 digits

Quinary134033434342221base 5; one hand: 15 digits

Septenary531055550464base 7: 12 digits

Nonary30735885521base 9; each digit is two ternary digits: 11 digits

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

Vigesimal888a1i5bbase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits

Sexagesimal13:51:43:46:28:31base 60; Babylonian, and still how an hour and a circle are divided: 6 digits

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

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

Bit-level

0000000000000000000000000000001010000010011111011100010111001111

Bit length34 bitsto write the magnitude

Set bits19the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 33worth 8,589,934,592

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes502 82 7d c5 cf

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

At each machine width

64-bit0000000000000000000000000000001010000010011111011100010111001111

One's complement1111111111111111111111111111110101111101100000100011101000110000at 64 bits, every bit flipped

Bits reversed1111001110100011101111100100000101000000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000000010100000100111110111000101110011110at 64 bits, wrapping

Shifted left by 110100000100111110111000101110011110= 21,558,430,622, no wrap

Shifted right by 1101000001001111101110001011100111= 5,389,607,655, discarding the low bit

These bits as a double5.32563997 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,779,215,327+16

Previous prime10,779,215,309−2

Distance to nearest prime0, it is prime

Nearest square below10,779,007,684

Nearest square above10,779,215,329

Powers & multiples

10,779,215,311 to the power 2116,191,482,720,896,826,721

10,779,215,311 to the power 31,252,453,009,552,883,014,242,317,125,231

10,779,215,311 to the power 4135004606568804658513126158204… (41 digits)

10,779,215,311 to the power 5145524372218199035001281597898… (51 digits)

First ten multiples10,779,215,311, 21,558,430,622, 32,337,645,933, 43,116,861,244, 53,896,076,555, 64,675,291,866, 75,454,507,177, 86,233,722,488, 97,012,937,799, 107,792,153,110

Powers of twoBetween 2^33 (8,589,934,592) and 2^34 (17,179,869,184)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1261the total stopping time

Highest value reached116,546,976,01610× the starting value

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

First steps10,779,215,311 → 32,337,645,934 → 16,168,822,967 → 48,506,468,902 → 24,253,234,451 → 72,759,703,354 → 36,379,851,677 → 109,139,555,032 → 54,569,777,516 → 27,284,888,758 → …

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

As a percentage & fraction

As a percentage1,077,921,531,100%

10,779,215,311% as a decimal107,792,153.11

10,779,215,311% of 10010,779,215,311

10,779,215,311% of 1,000107,792,153,110

As a fraction of 10010,779,215,311/100

Read another way

As seconds341 years, 209 days and 4 hours

As bytes10.039 GiB

Keep nerding

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