Recognised as Number
6,479,311
- Positive
- Odd
- Prime
- 7 digits
6,479,311 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,479,311
Digit count7
Digit sum31
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,479,311
Distinct prime factors16,479,311
Number of divisors2
Sum of divisors σ(n)6,479,312
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,479,310integers below n that share no factor with it
Carmichael function λ(n)6,479,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, 6,479,3112 in total
Arithmetic
Previous number6,479,310
Next number6,479,312
Double12,958,622
Half3,239,655.5
Square41,981,471,034,721
Cube272,011,007,071,449,157,231
Square root2,545.449076293≈irrational, shown to 9 decimal places
Cube root186.427342459≈
Negation-6,479,311
Reciprocal1.54337398 × 10^-7≈
Representations
Decimal6,479,311
Binary1100010110111011100111123 bits
Octal30556717
Hexadecimal62DDCF
Base 363UVGV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, four hundred and seventy-nine thousand, three hundred and eleven
Ordinalsix million, four hundred and seventy-nine thousand, three hundred and eleventh
Scientific notation6.479311 × 10^6
Engineering notation6.479311 × 10^6
In other bases
Ternary110012011221111base 3; the most digit-efficient integer base after e: 15 digits
Quinary3124314221base 5; one hand: 10 digits
Septenary106034056base 7: 9 digits
Nonary13164844base 9; each digit is two ternary digits: 8 digits
Duodecimal2205727base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal209i5bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal29:59:48:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101TT1TT0T1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001110010001011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011000101101110111001111
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes362 dd cf
Gray code10100111011001100101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011000101101110111001111
64-bit0000000000000000000000000000000000000000011000101101110111001111
One's complement11111111100111010010001000110000at 32 bits, every bit flipped
Bits reversed11110011101110110100011000000000at 32 bits
Rotated left by 100000000110001011011101110011110at 32 bits, wrapping
Shifted left by 1110001011011101110011110= 12,958,622, no wrap
Shifted right by 11100010110111011100111= 3,239,655, discarding the low bit
These bits as a double3.20120497 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,479,311 to the power 241,981,471,034,721
6,479,311 to the power 3272,011,007,071,449,157,231
6,479,311 to the power 41,762,443,910,239,118,310,387,547,841
6,479,311 to the power 511,419,422,214,495,331,898,795,452,989,217,551
First ten multiples6,479,311, 12,958,622, 19,437,933, 25,917,244, 32,396,555, 38,875,866, 45,355,177, 51,834,488, 58,313,799, 64,793,110
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached65,603,03210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,479,311 → 19,437,934 → 9,718,967 → 29,156,902 → 14,578,451 → 43,735,354 → 21,867,677 → 65,603,032 → 32,801,516 → 16,400,758 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage647,931,100%
6,479,311% as a decimal64,793.11
6,479,311% of 1006,479,311
6,479,311% of 1,00064,793,110
As a fraction of 1006,479,311/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,479,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page