Recognised as Number
6,506,519,477,440
- Positive
- Even
- Composite
- 13 digits
6,506,519,477,440 is an even 13-digit integer and a composite number. It has 56 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value6,506,519,477,440
Digit count13
Digit sum58
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 5 × 11,273 × 1,803,679
Distinct prime factors42, 5, 11,273, 1,803,679
Number of divisors56
Sum of divisors σ(n)15,495,032,499,840
Aliquot sum8,988,513,022,400sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,602,375,477,248integers below n that share no factor with it
Carmichael function λ(n)20,331,058,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,602,375,477,248
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 160, 320, 11,273, 22,546, 45,092, 56,365, 90,184, 112,730, 180,368, 225,460, 360,736, 450,920, 721,472, 901,840, 1,803,679, 1,803,680, 3,607,358, 3,607,360, 7,214,716, 9,018,395, 14,429,432, 18,036,790, 28,858,864, 36,073,580, 57,717,728, 72,147,160, 115,435,456, 144,294,320, 288,588,640, 577,177,280, 20,332,873,367, 40,665,746,734, 81,331,493,468, 101,664,366,835, 162,662,986,936, 203,328,733,670, 325,325,973,872, 406,657,467,340, 650,651,947,744, 813,314,934,680, 1,301,303,895,488, 1,626,629,869,360, 3,253,259,738,720, 6,506,519,477,44056 in total
Arithmetic
Previous number6,506,519,477,439
Next number6,506,519,477,441
Double13,013,038,954,880
Square42,334,795,710,306,090,668,953,600
Cube275,452,172,862,549,938,681,809,237,503,606,784,000
Square root2,550,788.01107422≈irrational, shown to 9 decimal places
Cube root18,668.793192077≈
Negation-6,506,519,477,440
Reciprocal1.53692001 × 10^-13≈
Representations
Decimal6,506,519,477,440
Binary101111010101110101011001000001111001100000043 bits
Octal136535262036300
Hexadecimal5EAEAC83CC0
Base 362B11XPBR4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix trillion, five hundred and six billion, five hundred and nineteen million, four hundred and seventy-seven thousand, four hundred and forty
Ordinalsix trillion, five hundred and six billion, five hundred and nineteen million, four hundred and seventy-seven thousand, four hundred and fortieth
Scientific notation6.50651948 × 10^12
Engineering notation6.506519 × 10^12
In other bases
Ternary212001000110112022000220011base 3; the most digit-efficient integer base after e: 27 digits
Quinary1323100322441234230base 5; one hand: 19 digits
Septenary1241036422014433base 7: 16 digits
Nonary25030415260804base 9; each digit is two ternary digits: 14 digits
Duodecimal89101025b994base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimalce3476edc0base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal2:19:27:26:15:21:30:40base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary10TT001000111TTT10T0010T0011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100011111100111111110110000100110111000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000001011110101011101010110010000011110011000000
Bit length43 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits22within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being even
Highest set bitbit 42worth 4,398,046,511,104
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes605 ea ea c8 3c c0
Gray code1110001111110011111101011000010001010100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000001011110101011101010110010000011110011000000
One's complement1111111111111111111110100001010100010101001101111100001100111111at 64 bits, every bit flipped
Bits reversed0000001100111100000100110101011101010111101000000000000000000000at 64 bits
Rotated left by 10000000000000000000010111101010111010101100100000111100110000000at 64 bits, wrapping
Shifted left by 110111101010111010101100100000111100110000000= 13,013,038,954,880, no wrap
Shifted right by 1101111010101110101011001000001111001100000= 3,253,259,738,720, discarding the low bit
These bits as a double3.21464775 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime3
Nearest square below6,506,519,420,944
Nearest square above6,506,524,522,521
Powers & multiples
6,506,519,477,440 to the power 242,334,795,710,306,090,668,953,600
6,506,519,477,440 to the power 3275,452,172,862,549,938,681,809,237,503,606,784,000
6,506,519,477,440 to the power 4179223492783335097597786948243… (52 digits)
6,506,519,477,440 to the power 5116612114660959709036236413378… (65 digits)
First ten multiples6,506,519,477,440, 13,013,038,954,880, 19,519,558,432,320, 26,026,077,909,760, 32,532,597,387,200, 39,039,116,864,640, 45,545,636,342,080, 52,052,155,819,520, 58,558,675,296,960, 65,065,194,774,400
Powers of twoBetween 2^42 (4,398,046,511,104) and 2^43 (8,796,093,022,208)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 40
Collatz (3n + 1) trajectory
Steps to reach 1216the total stopping time
Highest value reached6,506,519,477,440
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,506,519,477,440 → 3,253,259,738,720 → 1,626,629,869,360 → 813,314,934,680 → 406,657,467,340 → 203,328,733,670 → 101,664,366,835 → 304,993,100,506 → 152,496,550,253 → 457,489,650,760 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage650,651,947,744,000%
6,506,519,477,440% as a decimal65,065,194,774.4
6,506,519,477,440% of 1006,506,519,477,440
6,506,519,477,440% of 1,00065,065,194,774,400
As a fraction of 1006,506,519,477,440/100
Read another way
As seconds206,179 years, 58 days and 15 hours
As bytes5.918 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 6,506,519,477,440
Nearby primes
Also reads as
6506519477440 (identifier)
- 13 characters
- Checksum fails
6506519477440 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.
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