Recognised as Number
6,626,513
- Positive
- Odd
- Prime
- 7 digits
6,626,513 is an odd 7-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 value6,626,513
Digit count7
Digit sum29
Digit product6,480
Multiplicative persistence2times 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 factorisation6,626,513
Distinct prime factors16,626,513
Number of divisors2
Sum of divisors σ(n)6,626,514
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,626,512integers below n that share no factor with it
Carmichael function λ(n)6,626,512the 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, 6,626,5132 in total
Arithmetic
Previous number6,626,512
Next number6,626,514
Double13,253,026
Half3,313,256.5
Square43,910,674,539,169
Cube290,974,655,672,572,387,697
Square root2,574.20142957≈irrational, shown to 9 decimal places
Cube root187.828584133≈
Negation-6,626,513
Reciprocal1.50908932 × 10^-7≈
Representations
Decimal6,626,513
Binary1100101000111001101000123 bits
Octal31216321
Hexadecimal651CD1
Base 363Y11T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, six hundred and twenty-six thousand, five hundred and thirteen
Ordinalsix million, six hundred and twenty-six thousand, five hundred and thirteenth
Scientific notation6.626513 × 10^6
Engineering notation6.626513 × 10^6
In other bases
Ternary110110122212102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3144022023base 5; one hand: 10 digits
Septenary110216165base 7: 9 digits
Nonary13418772base 9; each digit is two ternary digits: 8 digits
Duodecimal2276955base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21865dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal30:40:41:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110111T000TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001010110110111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001010001110011010001
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes365 1c d1
Gray code10101111001001010111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001010001110011010001
64-bit0000000000000000000000000000000000000000011001010001110011010001
One's complement11111111100110101110001100101110at 32 bits, every bit flipped
Bits reversed10001011001110001010011000000000at 32 bits
Rotated left by 100000000110010100011100110100010at 32 bits, wrapping
Shifted left by 1110010100011100110100010= 13,253,026, no wrap
Shifted right by 11100101000111001101000= 3,313,256, discarding the low bit
These bits as a double3.27393243 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,626,513 to the power 243,910,674,539,169
6,626,513 to the power 3290,974,655,672,572,387,697
6,626,513 to the power 41,928,147,338,484,824,670,515,210,561
6,626,513 to the power 512,776,893,404,385,090,981,889,759,480,203,793
First ten multiples6,626,513, 13,253,026, 19,879,539, 26,506,052, 33,132,565, 39,759,078, 46,385,591, 53,012,104, 59,638,617, 66,265,130
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1377the total stopping time
Highest value reached516,442,55277× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,626,513 → 19,879,540 → 9,939,770 → 4,969,885 → 14,909,656 → 7,454,828 → 3,727,414 → 1,863,707 → 5,591,122 → 2,795,561 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage662,651,300%
6,626,513% as a decimal66,265.13
6,626,513% of 1006,626,513
6,626,513% of 1,00066,265,130
As a fraction of 1006,626,513/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 6,626,513
Nerdulate something else
Nothing in mind? Surprise me · today’s page