Recognised as Number
2,646,613
- Positive
- Odd
- Prime
- 7 digits
2,646,613 is an odd 7-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 value2,646,613
Digit count7
Digit sum28
Digit product5,184
Multiplicative persistence3times 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 factorisation2,646,613
Distinct prime factors12,646,613
Number of divisors2
Sum of divisors σ(n)2,646,614
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,646,612integers below n that share no factor with it
Carmichael function λ(n)2,646,612the 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,646,6132 in total
Arithmetic
Previous number2,646,612
Next number2,646,614
Double5,293,226
Half1,323,306.5
Square7,004,560,371,769
Cube18,538,360,539,208,668,397
Square root1,626.841418209≈irrational, shown to 9 decimal places
Cube root138.323768955≈
Negation-2,646,613
Reciprocal3.77841415 × 10^-7≈
Representations
Decimal2,646,613
Binary101000011000100101010122 bits
Octal12061125
Hexadecimal286255
Base 361KQ51
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and forty-six thousand, six hundred and thirteen
Ordinaltwo million, six hundred and forty-six thousand, six hundred and thirteenth
Scientific notation2.646613 × 10^6
Engineering notation2.646613 × 10^6
In other bases
Ternary11222110110201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1134142423base 5; one hand: 10 digits
Septenary31332034base 7: 8 digits
Nonary4873421base 9; each digit is two ternary digits: 7 digits
Duodecimala77731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgagadbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:15:10:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T110111T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011010011001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010000110001001010101
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes328 62 55
Gray code1111000101001101111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010000110001001010101
64-bit0000000000000000000000000000000000000000001010000110001001010101
One's complement11111111110101111001110110101010at 32 bits, every bit flipped
Bits reversed10101010010001100001010000000000at 32 bits
Rotated left by 100000000010100001100010010101010at 32 bits, wrapping
Shifted left by 110100001100010010101010= 5,293,226, no wrap
Shifted right by 1101000011000100101010= 1,323,306, discarding the low bit
These bits as a double1.30760056 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,646,613 to the power 27,004,560,371,769
2,646,613 to the power 318,538,360,539,208,668,397
2,646,613 to the power 449,063,866,001,756,671,492,189,361
2,646,613 to the power 5129,853,065,590,507,229,607,957,761,284,293
First ten multiples2,646,613, 5,293,226, 7,939,839, 10,586,452, 13,233,065, 15,879,678, 18,526,291, 21,172,904, 23,819,517, 26,466,130
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached7,939,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,646,613 → 7,939,840 → 3,969,920 → 1,984,960 → 992,480 → 496,240 → 248,120 → 124,060 → 62,030 → 31,015 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage264,661,300%
2,646,613% as a decimal26,466.13
2,646,613% of 1002,646,613
2,646,613% of 1,00026,466,130
As a fraction of 1002,646,613/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 2,646,613
Nerdulate something else
Nothing in mind? Surprise me · today’s page